Service systems with queueing often have both batch arrivals and batch services. This paper focuses on the number of busy servers and waiting customers in the GI(X)/M(R)/infinity system. For the number of busy servers, we obtain a recursive relation for the partial binomial moments in terms of matrices and explicit expressions for the marginal binomial moments. Special cases are also discussed to provide a more heuristic understanding of the model.
机构:
Korea Adv Inst Sci & Technol, Dept Ind & Syst Engn, Taejon 305701, South KoreaKorea Adv Inst Sci & Technol, Dept Ind & Syst Engn, Taejon 305701, South Korea
Chae, Kyung C.
Lim, Dae E.
论文数: 0引用数: 0
h-index: 0
机构:
Korea Adv Inst Sci & Technol, Dept Ind & Syst Engn, Taejon 305701, South KoreaKorea Adv Inst Sci & Technol, Dept Ind & Syst Engn, Taejon 305701, South Korea
Lim, Dae E.
Yang, Won S.
论文数: 0引用数: 0
h-index: 0
机构:
ETRI, Technol Strategy Res Div, Taejon 305701, South KoreaKorea Adv Inst Sci & Technol, Dept Ind & Syst Engn, Taejon 305701, South Korea
机构:
UNIV BRITISH COLUMBIA,FAC COMMERCE & BUSINESS ADM,VANCOVER,BRITISH COLUMBI,CANADAUNIV BRITISH COLUMBIA,FAC COMMERCE & BUSINESS ADM,VANCOVER,BRITISH COLUMBI,CANADA