Priority Queues with Random Order of Service

L. Durr
Additional contact information
L. Durr: Northern Electric Company Ltd., Brampton, Ontario, Canada

Operations Research, 1971, vol. 19, issue 2, 453-460

Abstract: Calls of two priorities arrive at a single server in accordance with a Poisson process. The calls are served in order of priority and for each priority in a random manner. This paper considers cases of preemptive-resume and nonpreemptive priorities, and derives the moments of the stationary distribution of the waiting time for each priority class. The variance of the waiting time, when the order of service is random, is shown to be greater than the corresponding variance when the order of service is first-in, first-out, and smaller than the corresponding variance when the order of service is last-in, first-out.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.2.453 (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:19:y:1971:i:2:p:453-460

Access Statistics for this article

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