IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/c6cfbc0d-ffd6-454c-983c-83a1c4b0ad4a.html
   My bibliography  Save this paper

Bad Luck When Joining the Shortest Queue

Author

Listed:
  • Blanc, J.P.C.

    (Tilburg University, Center For Economic Research)

Abstract

A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one's own queue. This paper quantifies the probability that one's service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Blanc, J.P.C., 2008. "Bad Luck When Joining the Shortest Queue," Discussion Paper 2008-54, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:c6cfbc0d-ffd6-454c-983c-83a1c4b0ad4a
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/994454/2008-54.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. B. M. Rao & M. J. M. Posner, 1987. "Algorithmic and approximation analyses of the shorter queue model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 381-398, June.
    2. J. P. C. Blanc, 1992. "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, INFORMS, vol. 40(1), pages 157-167, February.
    3. Yiqiang Zhao & W. K. Grassmann, 1990. "The shortest queue model with jockeying," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 773-787, October.
    4. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power- Series Algorithm," Papers 9347, Tilburg - Center for Economic Research.
    5. 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.
    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. de Palma, André & Fosgerau, Mogens, 2013. "Random queues and risk averse users," European Journal of Operational Research, Elsevier, vol. 230(2), pages 313-320.
    2. de Lange, Robert & Samoilovich, Ilya & van der Rhee, Bo, 2013. "Virtual queuing at airport security lanes," European Journal of Operational Research, Elsevier, vol. 225(1), pages 153-165.
    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. 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.
    5. Tanaka, Masahiro & Yanagisawa, Daichi & Nishinari, Katsuhiro, 2018. "Exclusive queueing model including the choice of service windows," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 490(C), pages 1481-1492.
    6. Hung, Ying-Chao & PakHai Lok, Horace & Michailidis, George, 2022. "Optimal routing for electric vehicle charging systems with stochastic demand: A heavy traffic approximation approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 526-541.

    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. Patrick Wang, 2000. "Workload distribution of discrete‐time parallel queues with two servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(5), pages 440-454, August.
    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. M. Saxena & I. Dimitriou & S. Kapodistria, 2020. "Analysis of the shortest relay queue policy in a cooperative random access network with collisions," Queueing Systems: Theory and Applications, Springer, vol. 94(1), pages 39-75, February.
    4. van den Hout, W.B. & Blanc, J.P.C., 1994. "The power-series algorithm for Markovian queueing networks," Other publications TiSEM 1312893d-c375-4b17-bbbe-3, Tilburg University, School of Economics and Management.
    5. Danielle Tibi, 2019. "Martingales and buffer overflow for the symmetric shortest queue model," Queueing Systems: Theory and Applications, Springer, vol. 93(1), pages 153-190, October.
    6. van den Hout, W.B. & Blanc, J.P.C., 1994. "The Power-Series Algorithm for a Wide Class of Markov Processes," Discussion Paper 1994-87, Tilburg University, Center for Economic Research.
    7. 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.
    8. Blanc, J.P.C., 1990. "Performance evaluation of polling systems by means of the power-series algorithm," Research Memorandum FEW 459, Tilburg University, School of Economics and Management.
    9. J. P. C. Blanc, 1992. "The Power-Series Algorithm Applied to the Shortest-Queue Model," Operations Research, INFORMS, vol. 40(1), pages 157-167, February.
    10. Herwig Bruneel & Arnaud Devos, 2024. "Explicit Solutions for Coupled Parallel Queues," Mathematics, MDPI, vol. 12(15), pages 1-31, July.
    11. Kao, Edward P. C. & Wilson, Sandra D., 1999. "Analysis of nonpreemptive priority queues with multiple servers and two priority classes," European Journal of Operational Research, Elsevier, vol. 118(1), pages 181-193, October.
    12. Simon Martin & Isi Mitrani, 2008. "Analysis of job transfer policies in systems with unreliable servers," Annals of Operations Research, Springer, vol. 162(1), pages 127-141, September.
    13. Koole, Ger & Pot, Auke, 2006. "Workload minimization in re-entrant lines," European Journal of Operational Research, Elsevier, vol. 174(1), pages 216-233, October.
    14. Blanc, J.P.C., 1999. "On the Stability of Communication Systems with Timed Token Protocols," Other publications TiSEM bd28ec2d-1fc2-447d-9c0a-c, Tilburg University, School of Economics and Management.
    15. Blanc, J.P.C., 1996. "Optimization of Periodic Polling Systems with Non-Preemptive, Time-Limited Service," Other publications TiSEM 2cdebb4d-bb27-44a9-b3c4-1, Tilburg University, School of Economics and Management.
    16. Blanc, J.P.C., 1998. "The power-series algorithm for polling systems with time limits," Other publications TiSEM 3366bad3-964d-4039-82cc-a, Tilburg University, School of Economics and Management.
    17. Shaul K. Bar-Lev & Hans Blanc & Onno Boxma & Guido Janssen & David Perry, 2013. "Tandem Queues with Impatient Customers for Blood Screening Procedures," Methodology and Computing in Applied Probability, Springer, vol. 15(2), pages 423-451, June.
    18. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
    19. Cao, Ping & Zhong, Zhiheng & Huang, Junfei, 2021. "Dynamic routing in a distributed parallel many-server service system: The effect of ξ-choice," European Journal of Operational Research, Elsevier, vol. 294(1), pages 219-235.
    20. Ger Koole & Olaf Passchier, 1997. "Optimal control in light traffic Markov decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(1), pages 63-79, February.

    More about this item

    Keywords

    Queueing; Join-the-shortest-queue; Probability of bad luck; Power-series algorithm; Overtaking customers; Dedicated customers;
    All these keywords.

    JEL classification:

    • C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Operations Research; Statistical Decision Theory
    • C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General

    Statistics

    Access and download statistics

    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:tiu:tiucen:c6cfbc0d-ffd6-454c-983c-83a1c4b0ad4a. 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: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    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.