Priority Queues

Lajos Takács
Additional contact information
Lajos Takács: Columbia University, New York

Operations Research, 1964, vol. 12, issue 1, 63-74

Abstract: Customers of different priorities are arriving at a counter in accordance with a Poisson process. The customers are served by a single server in order of priority and for each priority in order of arrival. Two cases are considered: (i) service with privileged interruptions and (ii) service without interruption. It is supposed that the service times are mutually independent random variables having a prescribed distribution for each priority and independent of the arrival times. In both cases (i) and (ii) a simple method is given for finding the Laplace-Stieltjes transform and the moments of the stationary distribution of the waiting time for each priority level.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.1.63 (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:12:y:1964:i:1:p:63-74

Access Statistics for this article

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