TY - JOUR
T1 - TWO REPAIRMEN PROBLEM
T2 - A FINITE SOURCE M/G/2 QUEUE.
AU - Knessl, C.
AU - Matkowsky, Bernard J
AU - Schuss, Z.
AU - Tier, C.
PY - 1987/1/1
Y1 - 1987/1/1
N2 - We consider a finite population M/G/2 queue in which the population size is M. We consider both the case of identical servers and also the situation when the two servers have different service time distributions. We assume that M VM GT TH 1 and that the mean service times are small, specifically, O(1/M). Then, we construct asymptotic expansions for the stationary distribution of the number of customers in the queueing system.
AB - We consider a finite population M/G/2 queue in which the population size is M. We consider both the case of identical servers and also the situation when the two servers have different service time distributions. We assume that M VM GT TH 1 and that the mean service times are small, specifically, O(1/M). Then, we construct asymptotic expansions for the stationary distribution of the number of customers in the queueing system.
UR - http://www.scopus.com/inward/record.url?scp=0023328171&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023328171&partnerID=8YFLogxK
U2 - 10.1137/0147024
DO - 10.1137/0147024
M3 - Article
AN - SCOPUS:0023328171
SN - 0036-1399
VL - 47
SP - 367
EP - 397
JO - SIAM Journal on Applied Mathematics
JF - SIAM Journal on Applied Mathematics
IS - 2
ER -