Skip to main content
SpringerLink
Log in

An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable server

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

This paper considers the bi-level control of an M/G/1 queueing system, in which an un-reliable server operates N policy with a single vacation and an early startup. The server takes a vacation of random length when he finishes serving all customers in the system (i.e., the system is empty). Upon completion of the vacation, the server inspects the number of customers waiting in the queue. If the number of customers is greater than or equal to a predetermined threshold m, the server immediately performs a startup time; otherwise, he remains dormant in the system and waits until m or more customers accumulate in the queue. After the startup, if there are N or more customers waiting for service, the server immediately begins serving the waiting customers. Otherwise the server is stand-by in the system and waits until the accumulated number of customers reaches or exceeds N. Further, it is assumed that the server breaks down according to a Poisson process and his repair time has a general distribution. We obtain the probability generating function in the system through the decomposition property and then derive the system characteristics

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

  • Artalejo JR (1998) Some results on the M/G/1 queue with N-policy. Asia-Pacific J Oper Res 15:147–157

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    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  MATH  MathSciNet  Google Scholar 

  • Choudhury G (2000) An M[x]/G/1 queueing system with a setup period and a vacation period. Queueing Syst 36:23–38

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  • Gakis KG, Rhee HK, Sivazlian BD (1995) Distributions and first moments of the busy and idle periods in controllable M/G/1 queueing models with simple and dyadic policies. Stoch Anal Appl 13(1):47–81

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Hur S, Paik SJ (1999) The effect of different arrival rates on the N-policy of M/G/1 with server setup. Appl Math Modell 23:289–299

    Article  MATH  Google Scholar 

  • Ke JC (2001) The control policy of an M[x]/G/1 queueing system with server startup and two vacation types. Math Methods Oper Res 54(3):471–490

    Article  MATH  MathSciNet  Google Scholar 

  • Kella O (1989) The threshold policy in the M/G/1 queue with server vacations. Naval Res Logist 36:111–123

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Lee HS, Srinivasan MM (1989) Control policies for the M[x]/G/1 queueing system. Manage Sci 35:708–721

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  • Lee HW, Lee SS, Chae KC (1994) Operating characteristics of M[x]/G/1 queue with N policy. Queueing Syst 15:387–399

    Article  MATH  MathSciNet  Google Scholar 

  • Lee SS, Lee HW, Chae KC (1995) On a batch arrival queue with N policy and single vacation. Comput Oper Res 22:173–189

    Article  MATH  Google Scholar 

  • Lee HW, Lee SS, Park JO, Chae KC (1994) Analysis of M[x]/G/1 queue with N policy and multiple vacations. J Appl Prob 31:467–496

    Article  MathSciNet  Google Scholar 

  • Lee HW, Park JG, Kim BK, Yoon SH, Ahn BY, Park NI (1998) Queue length and waiting time analysis of a batch arrival queue with bilevel control. Comput Oper Res 25:191–205

    Article  MATH  MathSciNet  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  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Sobel MJ (1969) Optimal average-cost policy for a queue with start-up and shut-down costs. Oper Res 17:145–158

    MATH  MathSciNet  Google Scholar 

  • Takagi H (1991) Queueing analysis: a foundation of performance evaluation. vol I. Vacation and priority systems, Part I. North-Holland, Amsterdam

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

    Article  MATH  MathSciNet  Google Scholar 

  • Tang YH (1997) A single-server M/G/1 queueing system subject to breakdowns – some reliability and queueing problem. Microelectron Reliab 37:315–321

    Article  Google Scholar 

  • Teghem J Jr (1987) Optimal control of a removable server in anM/G/1 queue with finite capacity. Eur J Oper Res 31:358-367

    Article  MATH  MathSciNet  Google Scholar 

  • Tijms HC (1986) Stochastic modelling and analysis. Wiley, NewYork

    Google Scholar 

  • Wang KH (1995) Optimal control of a Markovian queueing system with a removable and non-reliable server. Microelectron Reliab 35:1131–1136

    Article  Google Scholar 

  • Wang KH (1997) Optimal control of an M/E k /1 queueing system with removable service station subject to breakdowns. J Oper Res Soc 48:936–942

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Wang K-H, Ke J-C (2000) A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity. Appl Math Modell 24:899–914

    Article  MATH  Google Scholar 

  • Wang K-H, Ke J-C (2002) Control policies of an M/G/1 queueing system with a removable and non-reliable server. Int Trans Oper Res 9:195–212

    Article  MATH  MathSciNet  Google Scholar 

  • Wang K-H, Chang K-W, Sivazlian BD (1999) Optimal control of a removable and non-reliable server in an infinite and a finite M/H2/1 queueing system. Appl Math Modell 23:651–666

    Article  MATH  Google Scholar 

  • Yadin M, Naor P (1963) Queueing systems with a removable service station. Operl Res Quart 14: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

Corresponding author

Correspondence to Jau-Chuan Ke.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ke, JC. An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable server. Math Meth Oper Res 63, 357–369 (2006). https://doi.org/10.1007/s00186-005-0046-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-005-0046-0

Keywords

Search

Navigation