An N -Server Cutoff Priority Queue

Christian Schaack and Richard C. Larson
Additional contact information
Christian Schaack: Massachusetts Institute of Technology, Cambridge, Massachusetts
Richard C. Larson: Massachusetts Institute of Technology, Cambridge, Massachusetts

Operations Research, 1986, vol. 34, issue 2, 257-266

Abstract: We consider a multi-priority, nonpreemptive, multi-server queueing system, with Poisson arrivals and negative exponential service times. In order to save available servers for higher priority customers, the system deliberately queues arriving lower priority customers whenever the number of busy servers equals or exceeds a given priority-dependent cutoff number. A queued, priority i customer enters service the instant there are fewer than the respective cutoff number of servers busy and all higher priority queues are empty. We derive several performance measures for the waiting time of the i th priority class: its mean, its second moment, and its distribution (in transforms). We also extend the analysis to systems in which any subset of priority levels may overflow to some other system rather than join infinite capacity queues.

Keywords: 255 dispatching strategies; 681 control of server availability in prioritized M/M/m queues; 698 multiple-server cutoff (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.2.257 (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:34:y:1986:i:2:p:257-266

Access Statistics for this article

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