Two Queues Under Preemptive Priority with Poisson Arrival and Service Rates

Frederick F. Stephan
Additional contact information
Frederick F. Stephan: Princeton University, Princeton, New Jersey

Operations Research, 1958, vol. 6, issue 3, 399-418

Abstract: This paper extends the work of White and Christie, reported in O perations R esearch , vol 6, pp 79-95 (January-February, 1958), on preemptive priority queuing. A random walk procedure yields recursive relations between the state probabilities in the steady state. Recursive relations for the moments of the length of the lower priority queue follow. Combined with the use of moment generating functions, this approach provides moments of the waiting time for elements of the lower priority class that arrive when the system is in a given state, i.e., the two queues are of given lengths. The moments of waiting time and time in the system are also obtained recursively for the steady state. Routines for computing and checking are provided.

Date: 1958
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.6.3.399 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:6:y:1958:i:3:p:399-418

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().