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

Comparison of Policies for Routing Customers to Parallel Queueing Systems

Author

Listed:
  • D. J. Houck

    (AT&T Bell Laboratories, Holmdel, New Jersey)

Abstract

This paper studies a queueing system with two groups of servers, each with a separate queue, and with arriving customers routed irrevocably to one of the two queues. One natural policy for routing arriving customers is to send them to the queue with the shortest expected delay. Although this shortest delay routing policy (SDR) is known to be optimal if each server group has one server and the service time distribution has nondecreasing failure rate, little is known about the general multiserver case, even with exponential service times. In this paper we show, using a theoretical upper bound, that an optimal policy would produce delays that are almost identical to what would result from combining the two groups. In addition, our simulation results show that SDR performs nearly optimally in every case considered.

Suggested Citation

  • D. J. Houck, 1987. "Comparison of Policies for Routing Customers to Parallel Queueing Systems," Operations Research, INFORMS, vol. 35(2), pages 306-310, April.
    • Handle: RePEc:inm:oropre:v:35:y:1987:i:2:p:306-310
    DOI: 10.1287/opre.35.2.306
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.35.2.306
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.35.2.306?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. Brooks, James D. & Kar, Koushik & Mendonça, David J., 2016. "Allocation of flows in closed bipartite queueing networks," European Journal of Operational Research, Elsevier, vol. 255(2), pages 333-344.
    2. Benjaafar, Saifallah, 1995. "Performance bounds for the effectiveness of pooling in multi-processing systems," European Journal of Operational Research, Elsevier, vol. 87(2), pages 375-388, December.
    3. Ivo J. B. F. Adan & Onno J. Boxma & Stella Kapodistria & Vidyadhar G. Kulkarni, 2016. "The shorter queue polling model," Annals of Operations Research, Springer, vol. 241(1), pages 167-200, June.
    4. V.D. Dinopoulou & C. Melolidakis, 2001. "Asymptotically optimal component assembly plans in repairable systems and server allocation in parallel multiserver queues," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 732-746, December.
    5. Melissa A. Valentine & Amy C. Edmondson, 2015. "Team Scaffolds: How Mesolevel Structures Enable Role-Based Coordination in Temporary Groups," Organization Science, INFORMS, vol. 26(2), pages 405-422, April.
    6. Jacko, Peter, 2008. "Marginal productivity index policies for problems of admission control and routing to parallel queues with delay," DES - Working Papers. Statistics and Econometrics. WS ws087225, Universidad Carlos III de Madrid. Departamento de Estadística.
    7. P S Ansell & K D Glazebrook & C Kirkbride, 2003. "Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 379-389, April.
    8. Ick-Hyun Nam, 2001. "Dynamic Scheduling for a Flexible Processing Network," Operations Research, INFORMS, vol. 49(2), pages 305-315, April.

    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:35:y:1987:i:2:p:306-310. 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.