State Probabilities of M / M /1 Priority Queues

Barry I. Marks
Additional contact information
Barry I. Marks: IIT Research Institute, Chicago, Illinois

Operations Research, 1973, vol. 21, issue 4, 974-987

Abstract: This paper considers a preemptive priority and a nonpreemptive priority queuing model in the steady state. Each model assumes two priority levels, a single-service channel, no queue-length limit, and negative exponential interarrival-time and service-time distributions. The paper develops a set of computationally efficient recursion formulas that allow exact calculation of the state probabilities. In the nonpreemptive-priority case, this is the first time that a complete solution for the equilibrium-state probabilities has been obtained.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.4.974 (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:21:y:1973:i:4:p:974-987

Access Statistics for this article

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