Journal of the Korean Statistical Society

The Korean Statistical Society (한국통계학회)
권호 표지

A TRIAL SOLUTION APPROACH TO THE GI/M/1 QUEUE WITH N-POLICY AND EXPONENTIAL VACATIONS

  • Chae, Kyung-Chul (Department of Industrial Engineering, KAIST) ;
  • Lee, Sang-Min (Department of Industrial Engineering, KAIST) ;
  • Kim, Nam-Ki (Department of Industrial Engineering, Chonnam National University) ;
  • Kim, Jin-Dong (JP Morgan Chase Bank) ;
  • Lee, Ho-Woo (Department of System Management Engineering, Sungkyunkwan University)
  • Published : 2004.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

We present a trial solution approach to GI/M/l queues with generalized vacations. Specific types of generalized vacations we consider are N -policy and a combination of N-policy and exponential multiple vacations. Discussions about how to find trial solutions are given.

Keywords

References

  1. CHOI, B. D. AND HAN, D. H. (1994). 'G/M^a^,^b/1 queues with server vacations', Journal of the Operation Research Society of Japan, 37, 171-181 https://doi.org/10.15807/jorsj.37.171
  2. CHOI, B. D. AND PARK, K. K. (1991). 'A G/M/1 vacation model with exhaustive server', Communications of the Korean Mathematical Society, 6, 267-281
  3. DANIEL, J. K. AND KRISHNAMOORTHY, K. (1986). 'A GI/M/1 queue with rest periods', Optimization, 17, 535-543 https://doi.org/10.1080/02331938608843168
  4. DOSHI, B. T. (1986). 'Queueing systems with vacation-a survey', Queueing Systems, 1, 29-66 https://doi.org/10.1007/BF01149327
  5. EL-TAHA, M. AND STIDHAM JR., S. S. (1999). Sample-Path Analysis of Queueing Systems, Kluwer Academic Publishers, Boston
  6. GROSS, D. AND HARRIS, C. M. (1985). Fundamentals of Queueing Theory, 2nd ed., John Wiley & Sons, New York
  7. KARAESMEN, F. AND GUPTA, S. M. (1996). 'The finite capacity GI/M/1 queue with server vacations', Journal of the Operation Research Society, 47, 817-828 https://doi.org/10.1057/jors.1996.101
  8. KE, J. C. (2003). 'The analysis of a general input queue with N policy and exponential vacations', Queueing Systems, 45, 135-160 https://doi.org/10.1023/A:1026045706255
  9. KE, J. C. AND WANG, K. H. (2002). 'A recursive method for the N Policy G/M/1 queueing system with finite capacity', European Journal of Operation Research, 142, 577-594 https://doi.org/10.1016/S0377-2217(01)00317-4
  10. Ross, S. M. (1997). Introduction to Probability Models, 6th ed., Academic Press, San Diego
  11. TAKAGI, H. (1991). Queueing Analysis, Vol. 1, North-Holland, Amsterdam
  12. TAKAGI, H. (1993). Queueing Analysis, Vol. 2, North-Holland, Amsterdam
  13. TIAN, N., ZHANG, D. Q. AND CAO, C. X. (1989). 'The GI/M/1 queue with exponential vacations', Queueing Systems, 5, 331-344 https://doi.org/10.1007/BF01225323
  14. TIAN, N. AND ZHANG, Z. G. (2002). 'The discrete-time GI/Geo/1 queue with multiple vacations', Queueing Systems, 40, 283-294 https://doi.org/10.1023/A:1014711529740
  15. TIAN, N. AND ZHANG, Z. G. (2003). 'Stationary distribution of GI/M/c queue with PH type vacations', Queueing Systems, 44, 183-202 https://doi.org/10.1023/A:1024424606007
  16. WOLFF, R. W. (1982). 'Poisson arrivals see time averages', Operations Research, 30, 223-231 https://doi.org/10.1287/opre.30.2.223
  17. WOLFF, R. W. (1989). Stochastic Modeling and the Theory of Queues, Prentice-Hall, Englewood Cliffs, New Jersey
  18. ZHANG, Z. G. AND TIAN, N. (2004). 'The N threshold policy for the GI/M/1 queue', Operations Research Letters, 32, 77-84 https://doi.org/10.1016/S0167-6377(03)00067-1