Waiting-Time Distribution of a Multi-Server, Priority Queuing System

Richard H. Davis
Additional contact information
Richard H. Davis: Stanford Research Institute, Menlo Park, California

Operations Research, 1966, vol. 14, issue 1, 133-136

Abstract: An explicit formula is given for the waiting-time distribution of any number of parallel, negative-exponential servers subject to Poisson demands from any number of priority classes. The demand rates may be different for the priority classes, but the service rate is the same for all classes. The queue discipline is first-come-within-priority class sequence.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.1.133 (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:14:y:1966:i:1:p:133-136

Access Statistics for this article

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