IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v54y2003i4d10.1057_palgrave.jors.2601504.html
   My bibliography  Save this article

Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queues

Author

Listed:
  • P S Ansell

    (Newcastle University, Newcastle upon Tyne)

  • K D Glazebrook

    (University of Edinburgh)

  • C Kirkbride

    (Newcastle University, Newcastle upon Tyne)

Abstract

Jobs or customers arrive and require service that may be provided at one of several different stations. The associated routing problems concern how customers may be assigned to stations in an optimal manner. Much of the classical literature concerns a single class of customers seeking service from a collection of homogeneous stations. We argue that many contemporary application areas call for the analysis of routing problems in which many classes of customer seek service provided at a collection of diverse stations. This paper is the first to consider routing policies in such complex environments which take appropriate account of the degree of congestion at each service station. A simple and intuitive class of policies emerges from a policy improvement approach. In a numerical study, the policies were close to optimal in all cases.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:54:y:2003:i:4:d:10.1057_palgrave.jors.2601504
    DOI: 10.1057/palgrave.jors.2601504
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601504
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601504?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ger Koole, 1996. "On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers," Mathematics of Operations Research, INFORMS, vol. 21(2), pages 469-476, May.
    2. Benjamin L. Schwartz, 1974. "Queuing Models with Lane Selection: A New Class of Problems," Operations Research, INFORMS, vol. 22(2), pages 331-339, April.
    3. 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.
    4. Bruce Hajek, 1985. "Extremal Splittings of Point Processes," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 543-556, November.
    5. Zhen Liu & Rhonda Righter, 1998. "Optimal Load Balancing on Distributed Homogeneous Unreliable Processors," Operations Research, INFORMS, vol. 46(4), pages 563-573, August.
    6. Becker, K. J. & Gaver, D. P. & Glazebrook, K. D. & Jacobs, P. A. & Lawphongpanich, S., 2000. "Allocation of tasks to specialized processors: A planning approach," European Journal of Operational Research, Elsevier, vol. 126(1), pages 80-88, October.
    7. Linda Green, 1985. "A Queueing System with General-Use and Limited-Use Servers," Operations Research, INFORMS, vol. 33(1), pages 168-182, February.
    8. Ward Whitt, 1986. "Deciding Which Queue to Join: Some Counterexamples," Operations Research, INFORMS, vol. 34(1), pages 55-62, February.
    9. D. J. Houck, 1987. "Comparison of Policies for Routing Customers to Parallel Queueing Systems," Operations Research, INFORMS, vol. 35(2), pages 306-310, April.
    10. M. Dacre & K. Glazebrook & J. Niño‐Mora, 1999. "The achievable region approach to the optimal control of stochastic systems," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 61(4), pages 747-791.
    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. 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.
    2. K.D. Glazebrook & C. Kirkbride, 2004. "Index policies for the routing of background jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 856-872, September.
    3. Feng Chen & Vidyadhar G. Kulkarni, 2008. "Dynamic routing of prioritized warranty repairs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(1), pages 16-26, February.
    4. D Worthington, 2009. "Reflections on queue modelling from the last 50 years," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 83-92, May.

    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. Hyytiä, Esa & Penttinen, Aleksi & Aalto, Samuli, 2012. "Size- and state-aware dispatching problem with queue-specific job sizes," European Journal of Operational Research, Elsevier, vol. 217(2), pages 357-370.
    2. K.D. Glazebrook & C. Kirkbride, 2004. "Index policies for the routing of background jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 856-872, September.
    3. Marina Milenković & Miloš Nikolić & Draženko Glavić, 2022. "Optimization of toll road lane operation: Serbian case study," Operational Research, Springer, vol. 22(5), pages 5297-5322, November.
    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. Arie Hordijk & Dinard van der Laan, 2005. "On the Average Waiting Time for Regular Routing to Deterministic Queues," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 521-544, May.
    6. Dinard van der Laan, 2015. "Assigning Multiple Job Types to Parallel Specialized Servers," Tinbergen Institute Discussion Papers 15-102/III, Tinbergen Institute.
    7. 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.
    8. Hong Chen & Heng-Qing Ye, 2012. "Asymptotic Optimality of Balanced Routing," Operations Research, INFORMS, vol. 60(1), pages 163-179, February.
    9. Down, Douglas G. & Lewis, Mark E., 2006. "Dynamic load balancing in parallel queueing systems: Stability and optimal control," European Journal of Operational Research, Elsevier, vol. 168(2), pages 509-519, January.
    10. Zhong, Zhiheng & Cao, Ping, 2023. "Balanced routing with partial information in a distributed parallel many-server queueing system," European Journal of Operational Research, Elsevier, vol. 304(2), pages 618-633.
    11. 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.
    12. Eitan Altman & Bruno Gaujal & Arie Hordijk, 2000. "Multimodularity, Convexity, and Optimization Properties," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 324-347, May.
    13. Partha Chakroborty & Rahul Gill & Pranamesh Chakraborty, 2016. "Analysing queueing at toll plazas using a coupled, multiple-queue, queueing system model: application to toll plaza design," Transportation Planning and Technology, Taylor & Francis Journals, vol. 39(7), pages 675-692, October.
    14. José Niño-Mora, 2006. "Restless Bandit Marginal Productivity Indices, Diminishing Returns, and Optimal Control of Make-to-Order/Make-to-Stock M/G/1 Queues," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 50-84, February.
    15. 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.
    16. 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.
    17. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    18. Sai Rajesh Mahabhashyam & Natarajan Gautam & Soundar R. T. Kumara, 2008. "Resource-Sharing Queueing Systems with Fluid-Flow Traffic," Operations Research, INFORMS, vol. 56(3), pages 728-744, June.
    19. Esther Frostig & Gideon Weiss, 2016. "Four proofs of Gittins’ multiarmed bandit theorem," Annals of Operations Research, Springer, vol. 241(1), pages 127-165, June.
    20. Lamghari-Idrissi, Douniel & Basten, Rob & van Houtum, Geert-Jan, 2020. "Spare parts inventory control under a fixed-term contract with a long-down constraint," International Journal of Production Economics, Elsevier, vol. 219(C), pages 123-137.

    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:pal:jorsoc:v:54:y:2003:i:4:d:10.1057_palgrave.jors.2601504. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.