Bad luck when joining the shortest queue
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.
| Year of publication: |
2009
|
|---|---|
| Authors: | Blanc, J.P.C. |
| Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 195.2009, 1, p. 167-173
|
| Publisher: |
Elsevier |
| Keywords: | Queueing Join-the-shortest-queue Probability of bad luck Power-series algorithm Overtaking customers Dedicated customers |
Saved in:
Saved in favorites
Similar items by person
-
The Power-Series Algorithm Applied to Polling Systems with a Dormant Server.
Blanc, J.P.C., (1993)
-
Performance Analysis and Optimization with the Power- Series Algorithm.
Blanc, J.P.C., (1993)
-
The Power-Series Algorithm Extended to the BMAP/PH/1 Queue.
van den Hout, W.B., (1993)
- More ...