IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v34y1986i2p257-266.html
   My bibliography  Save this article

An N -Server Cutoff Priority Queue

Author

Listed:
  • Christian Schaack

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

  • Richard C. Larson

    (Massachusetts Institute of Technology, Cambridge, Massachusetts)

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.

Suggested Citation

  • Christian Schaack & Richard C. Larson, 1986. "An N -Server Cutoff Priority Queue," Operations Research, INFORMS, vol. 34(2), pages 257-266, April.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:2:p:257-266
    DOI: 10.1287/opre.34.2.257
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.2.257
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.2.257?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Diwakar Gupta & Lei Wang, 2008. "Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice," Operations Research, INFORMS, vol. 56(3), pages 576-592, June.
    2. Iannoni, Ana P. & Morabito, Reinaldo, 2023. "A review on hypercube queuing model's extensions for practical applications," Socio-Economic Planning Sciences, Elsevier, vol. 89(C).
    3. Noah Gans & Yong-Pin Zhou, 2003. "A Call-Routing Problem with Service-Level Constraints," Operations Research, INFORMS, vol. 51(2), pages 255-271, April.
    4. Soovin Yoon & Laura A. Albert, 2018. "An expected coverage model with a cutoff priority queue," Health Care Management Science, Springer, vol. 21(4), pages 517-533, December.
    5. Yoon, Soovin & Albert, Laura A., 2021. "Dynamic dispatch policies for emergency response with multiple types of vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:34:y:1986:i:2:p:257-266. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.