메뉴 건너뛰기




Volumn 19, Issue 1, 2006, Pages 36-53

Analysis and computational algorithm for queues with state-dependent vacations I: G/M(n)/1/K

Author keywords

G M(n) 1 K queue; Queue length distribution; Recursive algorithm; Removable server; State dependent service and vacations; Supplementary variable

Indexed keywords


EID: 33748928486     PISSN: 10096124     EISSN: 15597067     Source Type: Journal    
DOI: 10.1007/s11424-006-0036-1     Document Type: Article
Times cited : (12)

References (27)
  • 2
    • 0011358442 scopus 로고
    • GI/M/1 queue with exponential vacations
    • N. Tian, D. Zhang and C. Cao, GI/M/1 queue with exponential vacations, Queueing System, 1989, 5: 331-344.
    • (1989) Queueing System , vol.5 , pp. 331-344
    • Tian, N.1    Zhang, D.2    Cao, C.3
  • 5
    • 0001018863 scopus 로고
    • Queueing system with removable service station
    • M. Yadin and P. Naor, Queueing system with removable service station, Operational Research Quarterly, 1963, 14: 393-405.
    • (1963) Operational Research Quarterly , vol.14 , pp. 393-405
    • Yadin, M.1    Naor, P.2
  • 6
    • 0001682667 scopus 로고
    • Optimal operating policies for M/G/1 queueing system
    • D. P. Heyman, Optimal operating policies for M/G/1 queueing system, Operations Research, 1968, 16: 362-382.
    • (1968) Operations Research , vol.16 , pp. 362-382
    • Heyman, D.P.1
  • 7
    • 0000765298 scopus 로고
    • Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server
    • C. E. Bell, Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server, Operations Research, 1971, 19: 208-218.
    • (1971) Operations Research , vol.19 , pp. 208-218
    • Bell, C.E.1
  • 8
    • 0015680662 scopus 로고
    • Optimal operations of an M/G/1 priority queue with removable server
    • C. E. Bell, Optimal operations of an M/G/1 priority queue with removable server, Operations Research, 1972, 21: 1281-1289.
    • (1972) Operations Research , vol.21 , pp. 1281-1289
    • Bell, C.E.1
  • 9
    • 0019048147 scopus 로고
    • The optimal strategy structure of an intermittently operated service channel
    • M. Hersh and I. Brosh, The optimal strategy structure of an intermittently operated service channel, European Journal of Operational Research, 1980, 5: 133-141.
    • (1980) European Journal of Operational Research , vol.5 , pp. 133-141
    • Hersh, M.1    Brosh, I.2
  • 10
    • 0019716703 scopus 로고
    • Optimal control of an M/G/1 queueing system with removable server via diffusion approximation
    • T. Kimura, Optimal control of an M/G/1 queueing system with removable server via diffusion approximation, European Journal of Operational Research, 1981, 8: 390-398.
    • (1981) European Journal of Operational Research , vol.8 , pp. 390-398
    • Kimura, T.1
  • 12
    • 0023422804 scopus 로고
    • Optimal control of a removable server in an M/G/1 queue with finite capacity
    • J. Jr. Teghem, Optimal control of a removable server in an M/G/1 queue with finite capacity, European Journal of Operational Research, 1987, 31: 358-367.
    • (1987) European Journal of Operational Research , vol.31 , pp. 358-367
    • Teghem Jr., J.1
  • 13
    • 21844494165 scopus 로고
    • Distributions and first moments of the busy and idle periods in controllable M/G/1 queueing models with simple and dyadic policies
    • K. G. Gakis, H. K. Rhee and B. D. Sivazlian, Distributions and first moments of the busy and idle periods in controllable M/G/1 queueing models with simple and dyadic policies, Stochastic Analysis and Applications, 1995, 13: 47-81.
    • (1995) Stochastic Analysis and Applications , vol.13 , pp. 47-81
    • Gakis, K.G.1    Rhee, H.K.2    Sivazlian, B.D.3
  • 16
    • 0034305145 scopus 로고    scopus 로고
    • A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
    • K. H. Wang and J. C. Ke, A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity, Applied Mathematical Modelling, 2000, 24: 899-914.
    • (2000) Applied Mathematical Modelling , vol.24 , pp. 899-914
    • Wang, K.H.1    Ke, J.C.2
  • 17
    • 0016562766 scopus 로고
    • Utilization of idle time in an M/G/1 queueing system
    • Y. Levy and U. Yechiali, Utilization of idle time in an M/G/1 queueing system, Management Science, 1975, 22: 202-211.
    • (1975) Management Science , vol.22 , pp. 202-211
    • Levy, Y.1    Yechiali, U.2
  • 18
    • 34250125289 scopus 로고
    • Queueing system with vacations - A survey
    • B. T. Doshi, Queueing system with vacations - a survey, Queueing Systems, 1986, 1: 29-66.
    • (1986) Queueing Systems , vol.1 , pp. 29-66
    • Doshi, B.T.1
  • 21
    • 84989738068 scopus 로고
    • The threshold policy in the M/G/1 queue with server vacations
    • O. Kella, The threshold policy in the M/G/1 queue with server vacations, Naval Research Logistics, 1989, 36: 111-123.
    • (1989) Naval Research Logistics , vol.36 , pp. 111-123
    • Kella, O.1
  • 22
    • 0032188529 scopus 로고    scopus 로고
    • On multiple server queues with station and server vacations
    • X. Chao and Y. Zhao, On multiple server queues with station and server vacations, European Journal of Operations Research, 1998, 110: 392-406.
    • (1998) European Journal of Operations Research , vol.110 , pp. 392-406
    • Chao, X.1    Zhao, Y.2
  • 24
    • 0001654203 scopus 로고
    • A unified approach to GI/M(n)/1/K and M(n)/GI/1/K queues via, finite quasi-birth-death processes
    • M. Kijima and N. Makimoto, A unified approach to GI/M(n)/1/K and M(n)/GI/1/K queues via, finite quasi-birth-death processes, Stochastic Models, 1992, 8: 269-288.
    • (1992) Stochastic Models , vol.8 , pp. 269-288
    • Kijima, M.1    Makimoto, N.2
  • 25
    • 21844507069 scopus 로고
    • An unified algorithm for computing the stationary queue length distributions in M(k)/G/1/N and GI/M(k)/1/N queues
    • P. Yang, An unified algorithm for computing the stationary queue length distributions in M(k)/G/1/N and GI/M(k)/1/N queues, Queueing Systems, 1994, 17: 383-401.
    • (1994) Queueing Systems , vol.17 , pp. 383-401
    • Yang, P.1


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