Bad luck when joining the shortest queue

Hans Blanc

European Journal of Operational Research, 2009, vol. 195, issue 1, 167-173

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.

Keywords: Queueing; Join-the-shortest-queue; Probability; of; bad; luck; Power-series; algorithm; Overtaking; customers; Dedicated; customers (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00167-7
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Bad Luck When Joining the Shortest Queue (2008)
Working Paper: Bad Luck When Joining the Shortest Queue (2008)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:195:y:2009:i:1:p:167-173

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().