The control policy of an M[x]/G/1 queueing system with server startup and two vacation types

This paper studies the optimal control of an M[x]/G/1 queue with two types of generally distributed random vacation: type 1 (long) and type 2 (short) vacations. The server is turned off and takes type 1 vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than Q, the server will take a type 1 vacation. If the number of customers in the system is greater than or equal to Q and smaller than N, the server will take a type 2 vacation. If the server returns from a vacation and finds at least N customers in the system, he is immediately turned on and requires a startup time before providing the service until the system is again empty. We analyze the system characteristics for such a model. The total expected cost function per unit time is developed to determine the optimal thresholds of Q and N at a minimum cost.

[1]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[2]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[3]  Offer Kella.  The threshold policy in the M/G/1 queue with server vacations , 1989 .

[4]  M. Yadin,et al.  Queueing Systems with a Removable Service Station , 1963 .

[5]  Yutaka Baba,et al.  On the Mx/G /1 queue with vacation time , 1986 .

[6]  J. Medhi,et al.  Poisson input queueing system with startup time and under control-operating policy , 1987, Comput. Oper. Res..

[7]  Sun Hur,et al.  The effect of different arrival rates on the N-policy of M/G/1 with server setup , 1999 .

[8]  Hideaki Takagi.  M/G/1/K queues withN-policy and setup times , 1993, Queueing Syst. Theory Appl..

[9]  K. Chae,et al.  MX/G/1 Vacation Models with N-Policy: Heuristic Interpretation of the Mean Waiting Time , 1995 .

[10]  Kenneth R. Baker,et al.  A Note On Operating Policies For The Queue M/M/1 With Exponential Startups , 1973 .

[11]  Ho Woo Lee,et al.  ANALYSIS OF THE M(X)/G/1 QUEUE WITH N-POLICY AND MULTIPLE VACATIONS , 1994 .

[12]  Kyung C. Chae,et al.  Batch arrival queue with N-policy and single vacation , 1995, Comput. Oper. Res..

[13]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[14]  Do Le Minh,et al.  Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations , 1988 .

[15]  Mandyam M. Srinivasan,et al.  Control policies for the M X /g/ 1 queueing system , 1989 .

[16]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[17]  James G. C. Templeton,et al.  A poisson input queue under N-policy and with a general start up time , 1992, Comput. Oper. Res..