Control policies for the M X /g/ 1 queueing system

The M X /G/1 queueing system is studied under the following two situations: (1) At the end of a busy period, the server is turned off and inspects the length of the queue every time an arrival occurs. When the queue length reaches, or exceeds, a pre-specified value m for the first time, the server is turned on and serves the system until it is empty. (2) At the end of a busy period, the server takes a sequence of vacations, each for a random amount of time. At the end of each vacation, he inspects the length of the queue. If the queue length is greater than, or equal to, a pre-specified value m at this time, he begins to serve the system until it is empty. For both cases, the mean waiting time of an arbitrary customer for a given value of m is derived, and the procedure to find the stationary optimal policy under a linear cost structure is presented.

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

[2]  Daniel P. Heyman,et al.  Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..

[3]  Colin E. Bell,et al.  Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server , 1971, Oper. Res..

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

[5]  Matthew J. Sobel,et al.  Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs , 1969, Oper. Res..

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

[7]  V. Ramaswami.  The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

[8]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

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

[10]  M. Neuts,et al.  Introduction to Queueing Theory (2nd ed.). , 1983 .

[11]  Kashi R. Balachandran,et al.  Control Policies for a Single Server System , 1973 .

[12]  Mandyam M. Srinivasan,et al.  The continuous review (s,S) policy for production/inventory systems with Poisson demands and arbitrary processing times , 1987 .

[13]  Leonard Kleinrock,et al.  On the M/G/1 Queue with Rest Periods and Certain Service-Independent Queueing Disciplines , 1983, Oper. Res..

[14]  Michael J. Magazine,et al.  A Classified Bibliography of Research on Optimal Design and Control of Queues , 1977, Oper. Res..

[15]  Jacques Teghem,et al.  Control of the service process in a queueing system , 1986 .

[16]  Leonard Kleinrock,et al.  A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition , 1986, Oper. Res..

[17]  U. Yechiali,et al.  Utilization of idle time in an M/G/1 queueing system Management Science 22 , 1975 .

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

[19]  Daniel P. Heyman,et al.  The T-Policy for the M/G/1 Queue , 1977 .

[20]  Micha Hofri.  Queueing systems with a procrastinating server , 1986, SIGMETRICS '86/PERFORMANCE '86.