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

Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times

Author

Listed:
  • Esther Frostig

    (University of Haifa, Haifa, Israel)

  • Benny Levikson

    (University of Haifa, Haifa, Israel)

Abstract

We consider here the optimal routing of customers, arriving to a system consisting of two heterogeneous parallel servers. The service times of the two servers have an increasing hazard rate. The arrival process is a general renewal process. The cost of holding x customers in the system per time unit is a nondecreasing and convex function. The objective is to minimize the expected discounted holding cost. We show some monotonicity properties of the optimal policy. Then we show that the optimal policy routes an arriving customer to the fastest server whenever this server has the lowest workload.

Suggested Citation

  • Esther Frostig & Benny Levikson, 1999. "Optimal Routing of Customers to Two Parallel Heterogeneous Servers: The Case of IHR Service Times," Operations Research, INFORMS, vol. 47(3), pages 438-444, June.
    • Handle: RePEc:inm:oropre:v:47:y:1999:i:3:p:438-444
    DOI: 10.1287/opre.47.3.438
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.47.3.438
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.47.3.438?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
    ---><---

    References listed on IDEAS

    as
    1. Johri, Pravin K., 1989. "Optimality of the shortest line discipline with state-dependent service rates," European Journal of Operational Research, Elsevier, vol. 41(2), pages 157-161, July.
    2. Ward Whitt, 1986. "Deciding Which Queue to Join: Some Counterexamples," Operations Research, INFORMS, vol. 34(1), pages 55-62, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Tom F. Tan & Bradley R. Staats, 2020. "Behavioral Drivers of Routing Decisions: Evidence from Restaurant Table Assignment," Production and Operations Management, Production and Operations Management Society, vol. 29(4), pages 1050-1070, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. 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.
    2. Plinio S. Dester & Christine Fricker & Danielle Tibi, 2017. "Stationary analysis of the shortest queue problem," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 211-243, December.
    3. Josh Reed & Yair Shaki, 2015. "A Fair Policy for the G / GI / N Queue with Multiple Server Pools," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 558-595, March.
    4. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    5. Sarang Deo & Itai Gurvich, 2011. "Centralized vs. Decentralized Ambulance Diversion: A Network Perspective," Management Science, INFORMS, vol. 57(7), pages 1300-1319, July.
    6. Athanasia Manou & Antonis Economou & Fikri Karaesmen, 2014. "Strategic Customers in a Transportation Station: When Is It Optimal to Wait?," Operations Research, INFORMS, vol. 62(4), pages 910-925, August.
    7. 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.
    8. Blanc, J.P.C., 2009. "Bad luck when joining the shortest queue," European Journal of Operational Research, Elsevier, vol. 195(1), pages 167-173, May.
    9. Ali K. Parlaktürk & Sunil Kumar, 2004. "Self-Interested Routing in Queueing Networks," Management Science, INFORMS, vol. 50(7), pages 949-966, July.
    10. Hung T. Do & Masha Shunko, 2020. "Constrained Load-Balancing Policies for Parallel Single-Server Queue Systems," Management Science, INFORMS, vol. 66(8), pages 3501-3527, August.
    11. Blanc, J.P.C., 2008. "Bad Luck When Joining the Shortest Queue," Other publications TiSEM c6cfbc0d-ffd6-454c-983c-8, Tilburg University, School of Economics and Management.
    12. Jori Selen & Ivo Adan & Stella Kapodistria & Johan Leeuwaarden, 2016. "Steady-state analysis of shortest expected delay routing," Queueing Systems: Theory and Applications, Springer, vol. 84(3), pages 309-354, December.
    13. Fernanda Campello & Armann Ingolfsson & Robert A. Shumsky, 2018. "Queueing Models of Case Managers," Management Science, INFORMS, vol. 64(1), pages 7-26, January.
    14. Yi Ouyang & Demosthenis Teneketzis, 2022. "Signaling for decentralized routing in a queueing network," Annals of Operations Research, Springer, vol. 317(2), pages 737-775, October.
    15. Rami Atar & Isaac Keslassy & Gal Mendelson, 2019. "Replicate to the shortest queues," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 1-23, June.
    16. Maria E. Mayorga & Emmett J. Lodree & Justin Wolczynski, 2017. "The optimal assignment of spontaneous volunteers," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1106-1116, September.
    17. Rob Shone & Vincent A. Knight & Paul R. Harper, 2020. "A conservative index heuristic for routing problems with multiple heterogeneous service facilities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(3), pages 511-543, December.
    18. Yan Chen & Ward Whitt, 2020. "Algorithms for the upper bound mean waiting time in the GI/GI/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 327-356, April.
    19. Legros, Benjamin & Jouini, Oualid, 2019. "On the scheduling of operations in a chat contact center," European Journal of Operational Research, Elsevier, vol. 274(1), pages 303-316.
    20. Debankur Mukherjee & Sem C. Borst & Johan S. H. van Leeuwaarden & Philip A. Whiting, 2020. "Asymptotic Optimality of Power-of- d Load Balancing in Large-Scale Systems," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1535-1571, November.

    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:47:y:1999:i:3:p:438-444. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.