메뉴 건너뛰기




Volumn 110, Issue 2, 1998, Pages 392-406

Analysis of multi-server queues with station and server vacations

Author keywords

Embedded Markov chains; Hessenberg matrix; Matrix geometric solutions; Queueing; Server and station vacations

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; QUEUEING THEORY;

EID: 0032188529     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00253-1     Document Type: Article
Times cited : (59)

References (14)
  • 1
    • 34250125289 scopus 로고
    • Queueing systems with vacations: A survey
    • Doshi, B.T., 1986. Queueing systems with vacations: A survey. Queueing Systems 1, 29-66.
    • (1986) Queueing Systems , vol.1 , pp. 29-66
    • Doshi, B.T.1
  • 2
    • 0002480644 scopus 로고
    • Single server queues with vacations
    • Takagi, H. (Ed.), Elsevier, North-Holland, Amsterdam
    • Doshi, B.T., 1990. Single server queues with vacations. Stochastic Analysis of Computer and Communication Systems. In: Takagi, H. (Ed.), Elsevier, North-Holland, Amsterdam, pp. 217-265.
    • (1990) Stochastic Analysis of Computer and Communication Systems , pp. 217-265
    • Doshi, B.T.1
  • 3
    • 0000572102 scopus 로고
    • Equilibrium distribution of block-structured Markov chains with repeating rows
    • Grassmann, W.K., Heyman, D.P., 1990. Equilibrium distribution of block-structured Markov chains with repeating rows. J. Appl. Prob. 27, 557-576.
    • (1990) J. Appl. Prob. , vol.27 , pp. 557-576
    • Grassmann, W.K.1    Heyman, D.P.2
  • 4
    • 0040539256 scopus 로고
    • Computation of steady-state probabilities for infinite-state Markov chains with repeating rows
    • Grassmann, W.K., Heyman, D.P., 1993. Computation of steady-state probabilities for infinite-state Markov chains with repeating rows. ORSA J. Computing 5, 292-303.
    • (1993) ORSA J. Computing , vol.5 , pp. 292-303
    • Grassmann, W.K.1    Heyman, D.P.2
  • 5
    • 0002229115 scopus 로고
    • Algorithms for infinite Markov chains with repeating columns
    • Meyer, C.D., Plemmons, R.J. (Eds.), Springer, New York
    • Latouche, G., 1993. Algorithms for infinite Markov chains with repeating columns. In: Meyer, C.D., Plemmons, R.J. (Eds.), Linear Algebra, Markov Chains and Queueing Models. Springer, New York, pp. 231-265.
    • (1993) Linear Algebra, Markov Chains and Queueing Models , pp. 231-265
    • Latouche, G.1
  • 11
    • 0022660231 scopus 로고
    • Control of the service process in a queueing system
    • Teghem Jr., J., 1986. Control of the service process in a queueing system. Eur. J. Oper. Res. 23, 141-158.
    • (1986) Eur. J. Oper. Res. , vol.23 , pp. 141-158
    • Teghem J., Jr.1
  • 12
    • 0011358442 scopus 로고
    • The GI/M/1 queue with exponential vacations
    • Tian, N., Zhang, D., Cao, C., 1989.The GI/M/1 queue with exponential vacations. Queueing Systems 5, 331-344.
    • (1989) Queueing Systems , vol.5 , pp. 331-344
    • Tian, N.1    Zhang, D.2    Cao, C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.