Preemptive Priority Queues

Wei Chang
Additional contact information
Wei Chang: IBM Corporation, Kingston, New York

Operations Research, 1965, vol. 13, issue 5, 820-827

Abstract: Customers of different priorities arrive 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. Preemptive discipline is assumed. Three service policies are considered: (i) preemptive-resume, (ii) preemptive-repeat-identical, and (iii) preemptive-repeat-different. The time-dependent solutions for these priority systems are very complicated. However, the problem can be simplified in case of stationary solutions. In this paper, a step-by-step method is proposed to find the stationary distributions of the queue sizes, the waiting times, and the busy periods of each priority class.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.5.820 (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:13:y:1965:i:5:p:820-827

Access Statistics for this article

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