Skip to main content
Log in

Analysis of Single Server Queue with Modified Vacation Policy

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

This article deals with single server queue with modified vacation policy. The modified vacation policy captures the operation of a close down period, type 1 vacation period, type 2 vacation period, a start-up period and a dormant period. Here, type 1 vacations takes a short period of random duration and type 2 vacation take a long period of random duration. Explicit expressions have been obtained for steady state queue size distribution at service completion point and steady state system size probabilities. The Laplace-Stieltjes transform of waiting time and its corresponding mean value have been obtained for the system. Finally, some numerical examples have been provided and use the parabolic method to search the optimum value of the control parameter p.

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

  • Artalejo JR, Economou A, Lopez-Herrero MJ (2005) Analysis of multiserver queue with setup times. Queueing Syst 52(1–2):53–76

    Article  MathSciNet  Google Scholar 

  • Baker KR (1973) A note on operating policies for the queue M/M/1 with exponential setup. INFOR 11:71–72

    MATH  Google Scholar 

  • Borthakur A, Medhi J, Gohain R (1987) Poisson input queueing systems with startup time and under control operating policy. Comput Oper Res 14:33–40

    Article  MathSciNet  Google Scholar 

  • Choudhury G (2002a) A batch arrival queue with a vacation time under single vacation policy. Comp Oper Res 29:1941–1955

    Article  MathSciNet  Google Scholar 

  • Choudhury G (2002b) Analysis of the MX/G/1 queueing system with vacation times. Sankhya: Indian J Stat 64:37–49

    MATH  Google Scholar 

  • Cooper RB (1981) Introduction to queueing theory. Elsevier, Amsterdam

    MATH  Google Scholar 

  • Doshi BT (1986) Queueing systems with vacations a survey. Queueing Syst 1:29–66

    Article  MathSciNet  Google Scholar 

  • Doshi BT (1990) Single sever queues with vacations. In: Takagi H (ed) Stochastic analysis of computer and communication systems. North-Holland, pp 217–265

  • Fuhrmann SW, Cooper RB (1985) Stochastic decomposition in the M/G/1 queue with generalized vacations. Oper Res 33:1117–1129

    Article  MathSciNet  Google Scholar 

  • Heyman DP (1968) Optimal operating policies for M/G/1 queueing system. Oper Res 16:362–382

    Article  Google Scholar 

  • Ke JC (2003) The optimal control of an M/G/1 queueing system with server startup and two vacation types. Appl Math Model 27:437–450

    Article  Google Scholar 

  • Ke JC, Huang KB, Pearn WL (2010d) The randomized vacation policy for a batch arrival queue. Appl Math Model 34:1524–1538

    Article  MathSciNet  Google Scholar 

  • Krishnakumar B, Rukmani R, Anantha Lakshmi SR (2013) Performance analysis of an M/G/1 queueing system under Bernoulli vacation schedules with server setup and close down periods. Comp Indus Eng 66:1–9

    Article  Google Scholar 

  • Krishnakumar B, Anbarasu S, Anantha Lakshmi SR (2015) Performance analysis for queueing systems with close down periods and server under maintenance. Int J Syst Sci 46:88–110

    Article  MathSciNet  Google Scholar 

  • Kulkarni VG (1995) Modelling and analysis of stochastic systems. Chapman & Hall, London

    Google Scholar 

  • Lee HW, Park JO (1997) Optimal strategy in N-policy production systems with early setup. J Oper Res Soc 48:306–313

    Article  Google Scholar 

  • Levy Y, Yechiali U (1975) Utilization of idle time in an M/G/1 queue with server vacations. Manag Sci 22:202–211

    Article  Google Scholar 

  • Medhi J, Templetion JGC (1992) A Poisson input queue under N-policy and with a general startup time. Comput Oper Res 19:35–41

    Article  Google Scholar 

  • Minh DL (1988) Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations. Eur J Oper Res 36:197–201

    Article  MathSciNet  Google Scholar 

  • Niu Z, Takahashi Y (1999) A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes. Queueing Syst 31:1–23

    Article  MathSciNet  Google Scholar 

  • Niu Z, Takahashi Y, Endo N (1998) Performance evaluation of SVC-based IPover-ATM networks. IEICE Trans Commun E81-B:948–957

    Google Scholar 

  • Niu Z, Shu T, Takahashi Y (2003) A vacation queue with setup and close-down times and batch Markovian arrival processes. Perform Eval 54:225–248

    Article  Google Scholar 

  • Ronald LR (1997) Optimization in operations research. Prentice Hall, New Jersey

    Google Scholar 

  • Sakai Y, Takahashi Y, Takahashi Y, Hasegawa T (1998) A composite queue with vacation/set-up/close-down times for SVCC in IP over ATM networks. J Oper Res Soc Jpn 41:68–80

    Article  MathSciNet  Google Scholar 

  • Takacs L (1962) Introduction to the theory of Queues. Oxford University Press, New York

    MATH  Google Scholar 

  • Takagi H (1991) Queueing analysis vol: 1, vacation and priority systems. North Holland, Amsterdam

    MATH  Google Scholar 

  • Takagi H (1993) M/G/1/K queues with N-policy and setup times. Queueing Syst 14:79–98

    Article  MathSciNet  Google Scholar 

  • Tian N, Zhang ZG (2006) Vacation queueing models: theory and applications. Springer, New York

    Book  Google Scholar 

  • Zhang ZG, Vickson RG, Van Eengie MJA (1997) Optimal two threshold policies in an M/G/1 queue with two vacation types. Perf Eval 29:63–80

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Priyanka Kalita.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kalita, P., Choudhury, G. & Selvamuthu, D. Analysis of Single Server Queue with Modified Vacation Policy. Methodol Comput Appl Probab 22, 511–553 (2020). https://doi.org/10.1007/s11009-019-09713-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-019-09713-9

Keywords

Mathematics Subject Classification (2010)

Navigation