A Single-Server Priority Queuing System with General Holding Times, Poisson Input, and Reverse-Order-of-Arrival Queuing Discipline

L. Durr
Additional contact information
L. Durr: Ottawa University and Northern Electric Co., Ltd., Ottawa, Ontario, Canada

Operations Research, 1969, vol. 17, issue 2, 351-358

Abstract: This paper gives an explicit formula for the waiting-time distribution in a single-server system with general holding times subject to a Poisson input from any number of priority classes. In the general case, where the holding-time distributions of the demands in each priority case are different, the Laplace-Stieltjes transform and the moments of the distribution are found. The queue discipline is last-come first-served in each priority class. The cases of preemptive resume and nonpreemptive priorities are considered. It is shown that the variance of the waiting-time distribution (whatever the holding-time distribution) is greater than the corresponding variance when the queue discipline is first-come first-served.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.2.351 (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:17:y:1969:i:2:p:351-358

Access Statistics for this article

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