Skip to main content
SpringerLink
Log in

The Analysis of a General Input Queue with N Policy and Exponential Vacations

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper studies a single removable server in a G/M/1 queueing system with finite capacity where the server applies an N policy and takes multiple vacations when the system is empty. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distributions of the number of customers in the system. The method is illustrated analytically for exponential and deterministic interarrival time distributions. We establish the distributions of the number of customers in the queue at pre-arrival epochs and at arbitrary epochs, as well as the distributions of the waiting time and the busy period.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. C.E. Bell, Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server, Oper. Res. 19 (1971) 208–218.

    Google Scholar 

  2. C.E. Bell, Optimal operation of anM/G/1 priority queue with removable server, Oper. Res. 21 (1972) 1281–1289.

    Google Scholar 

  3. U. Chatterjee and S. Mukherjee, GI/M/1 queue with server vacation, J. Oper. Res. Soc. 41 (1990) 83–87.

    Google Scholar 

  4. B.T. Doshi, Queueing systems with vacations – a survey, Queueing Systems 1 (1986) 29–66.

    Google Scholar 

  5. S.W. Fuhrmann and R.B. Cooper,Stochastic decompositions in the M/G/1 queue with generalized vacations, Oper. Res. 33 (1985) 1117–1129.

    Google Scholar 

  6. 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 Anal. Appl. 13 (1995) 47–81.

    Google Scholar 

  7. M. Hersh and I. Brosh, The optimal strategy structure of an intermittently operated service channel, European J. Oper. Res. 5 (1980) 133–141.

    Google Scholar 

  8. D.P. Heyman, Optimal operating policies forM/G/1 queueing system, Oper. Res. 16 (1968) 362–382.

    Google Scholar 

  9. F. Karaesmen and S.M. Gupta, The finite capacity GI/M/1 queue with server vacation, J. Oper. Res. Soc. 47 (1996) 817–828.

    Google Scholar 

  10. O. Kella, The threshold policy in the M/G/1 queue with server vacations, Naval. Res. Logist. 36 (1989) 111–123. 160 J.-C. KE

    Google Scholar 

  11. M. Kijima and N. Makimoto, A unified approach to GI/M(n)/1/K and M(n)/G/1/K queues via finite quasi-birth–death processes, Commun. Statist. Stochastic Models 8 (1992) 269–288.

    Google Scholar 

  12. T. Kimura, Optimal control of an M/G/1 queueing system with removable server via diffusion approximation, European J. Oper. Res. 8 (1981) 390–398.

    Google Scholar 

  13. G.V. Krishna Reddy, R. Nadarajan and R. Arumuganathan, Analysis of a bulk queue with N-policy multiple vacations and setup times, Comput. Oper. Res. 25 (1998) 957–967.

    Google Scholar 

  14. P.-V. Laxmi and U.C. Gupta, On the finite-buffer bulk-service queue with general independent arrivals: GI/M[x]/1/N, Oper. Res. Lett. 25 (1999) 241–245.

    Google Scholar 

  15. S.S. Lee, H.W. Lee and K.C. Chae, On a batch arrival queue with N policy and single vacation, Comput. Oper. Res. 22 (1995) 173–189.

    Google Scholar 

  16. H.W. Lee, S.S. Lee, J.O. Park and K.C. Chae, Analysis ofM[x]/G/1 queue with N policy and multiple vacations, J. Appl. Probab. 31 (1994) 467–496.

    Google Scholar 

  17. H.S. Lee and M.M. Srinivasan, Control policies for the M[x]/G/1 queueing system, Managm. Sci. 35 (1989) 708–721.

    Google Scholar 

  18. Y. Levy and U. Yechiali, Utilization of idle time in an M/G/1 queueing system, Managm. Sci. 22 (1975) 202–211.

    Google Scholar 

  19. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. I, Vacation and Priority Systems, Part I (North-Holland, Amsterdam 1991).

  20. J. Jr. Teghem, Optimal control of a removable server in an M/G/1 queue with finite capacity, European J. Oper. Res. 31 (1987) 358–367.

    Google Scholar 

  21. N. Tian, D. Zhang and C. Cao, The GI/M/1 queue with exponential vacations, Queueing Systems 5 (1989) 331–344.

    Google Scholar 

  22. H.C. Tijms, Stochastic Modelling and Analysis (Wiley, New York, 1986).

    Google Scholar 

  23. K.-H. Wang and H.-M. Huang, Optimal control of an M/Ek/1 queueing system with a removable service station, J. Oper. Res. Soc. 46 (1995) 1014–1022.

    Google Scholar 

  24. K.-H. Wang and H.-M. Huang, Optimal control of a removable server in an M/Ek/1 queueing system with finite capacity, Microelectronics Reliability 35 (1995) 1023–1030.

    Google Scholar 

  25. 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, Appl. Math. Modelling 24 (2000) 899–914.

    Google Scholar 

  26. M. Yadin and P. Naor, Queueing systems with removable service station, Oper. Res. Quart. 14 (1963) 393–405.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, National Taichung Institute of Technology, Taichung 404, Taiwan, R.O.C.

    Jau-Chuan Ke

Authors
  1. Jau-Chuan Ke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ke, JC. The Analysis of a General Input Queue with N Policy and Exponential Vacations. Queueing Systems 45, 135–160 (2003). https://doi.org/10.1023/A:1026045706255

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026045706255

Search

Navigation