Skip to main content
Log in

Vacation policies in an M/G/1 type queueing system with finite capacity

  • Contributed Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

This paper deals with a queueing system with finite capacity in which the server passes from the active state to the inactive state each time a service terminates withv customers left in the system. During the active (inactive) phases, the arrival process is Poisson with parameter λ (λ0). Denoting byu n the duration of thenth inactive phase and byx n the number of customers present at the end of thenth inactive phase, we assume that the bivariate random vectors {(v n ,x n ),n ⩾ 1} are i.i.d. withx n ⩾v+l a.s. The stationary queue length distributions immediately after a departure and at an arbitrary instant are related to the corresponding distributions in the classical model.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.W. Cohen,The Single Server Queue (North-Holland, Amsterdam, 1969).

    Google Scholar 

  2. P.J. Courtois, The M/G/1 finite capacity queue with delays, I.E.E.E. Trans. Commun. COM-28 (1980) 165–172.

    Google Scholar 

  3. B.T. Doshi, A note on stochastic decomposition in a GI/G/1 queue with vacation or set-up times, J. Appl. Prob. 22 (1985) 419.

    Google Scholar 

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

    Google Scholar 

  5. C. Fricker, Etude d'une file GI/G/1 à Service autonome (avec vacances du serveur), Adv. Appl. Prob. 18 (1986) 283–286.

    Google Scholar 

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

    Google Scholar 

  7. E. Gelenbe and R. Iasnogorodski, A queue with server of walking type (autonomous service), Ann. Inst. H. Poincaré 16 (1980) 63–73.

    Google Scholar 

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

    Google Scholar 

  9. T. Lee, M/G/1/N queue with vacation time and exhaustive service discipline, Opns. Res. 32 (1984) 774–784.

    Google Scholar 

  10. J. Loris-Teghem, Imbedded and non-imbedded stationary distributions in a finite capacity queueing system with removable server, Cah. Centre Et. Rech. Op. 26 (1984) 87–94.

    Google Scholar 

  11. J. Loris-Teghem, Analysis of single server queueing systems with vacation periods, Belgian J. Op. Res., Stat. and Comp. Sc. 25 (1985) 47–54.

    Google Scholar 

  12. J. Teghem, Jr., Properties of (0,k)-policies in an M/G/1 queue and optimal joining rules in an M/M/1 queue with removable server,Operational Research 75, ed. K.B. Haley (North-Holland, Amsterdam, 1976), 229–259.

    Google Scholar 

  13. J. Teghem, Jr. Optimal pricing and operating policies in a queueing system,Advances in Op. Res., ed. M. Roubens (North-Holland, Amsterdam, 1977), 489–496.

    Google Scholar 

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

    Google Scholar 

  15. F.A. van der Duyn Schouten, An M/G/1 queueing model with vacation times, Zeitsch. Op. Res. 22 (1978) 95–105.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Loris-Teghem, J. Vacation policies in an M/G/1 type queueing system with finite capacity. Queueing Syst 3, 41–52 (1988). https://doi.org/10.1007/BF01159086

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01159086

Keywords

Navigation