Bad Luck When Joining the Shortest Queue
AbstractA 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2008-54.
Date of creation: 2008
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
Queueing; Join-the-shortest-queue; Probability of bad luck; Power-series algorithm; Overtaking customers; Dedicated customers;
Other versions of this item:
- 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
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Blanc, J.P.C., 1987. "On a numerical method for calculating state probabilities for queueuing systems with more than one waiting line," Open Access publications from Tilburg University urn:nbn:nl:ui:12-384454, Tilburg University.
- Blanc, J.P.C., 1992.
"The power-series algorithm applied to the shortest-queue model,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-384449, Tilburg University.
- Blanc, J.P.C., 1989. "The power-series algorithm applied to the shortest-queue model," Research Memorandum 379, Tilburg University, Faculty of Economics and Business Administration.
- 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.
- Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power- Series Algorithm," Papers 9347, Tilburg - Center for Economic Research.
- Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power-Series Algorithm," Discussion Paper 1993-47, Tilburg University, Center for Economic Research.
- Blanc, J.P.C., 1987. "A note on waiting times in systems with queues in parallel," Open Access publications from Tilburg University urn:nbn:nl:ui:12-384453, Tilburg University.
- de Palma, André & Fosgerau, Mogens, 2013.
"Random queues and risk averse users,"
European Journal of Operational Research,
Elsevier, vol. 230(2), pages 313-320.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.