TY - JOUR
T1 - The variance of the waiting time in a queueing system with jockeying
AU - Haviv, Moshe
AU - Ritov, Ya'acov
PY - 1988
Y1 - 1988
N2 - This paper considers the M/M/k queueing system where a line is being formed in front of each server. Arriving customers join the shorter line and switch to another once the latter becomes shorter. Since the expected waiting time equals that in the first come first served case (FCFS), it is of interest to compute the variance of the waiting time. We compute it explicitly for the cases where k = 1, k = 2, k =. 3 and for the case of a random queue. For the case k ^ 4, we express the variance in terms of the roots of a k-degree polynomial.
AB - This paper considers the M/M/k queueing system where a line is being formed in front of each server. Arriving customers join the shorter line and switch to another once the latter becomes shorter. Since the expected waiting time equals that in the first come first served case (FCFS), it is of interest to compute the variance of the waiting time. We compute it explicitly for the cases where k = 1, k = 2, k =. 3 and for the case of a random queue. For the case k ^ 4, we express the variance in terms of the roots of a k-degree polynomial.
UR - http://www.scopus.com/inward/record.url?scp=84963133398&partnerID=8YFLogxK
U2 - 10.1080/15326348808807076
DO - 10.1080/15326348808807076
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84963133398
SN - 0882-0287
VL - 4
SP - 161
EP - 182
JO - Communications in Statistics. Part C: Stochastic Models
JF - Communications in Statistics. Part C: Stochastic Models
IS - 1
ER -