Optimality of threshold policies in single-server queueing systems with server vacations

In this paper we consider a class of single-server queueing systems with compound Poisson arrivals, in which, at service completion epochs, the server has the option of taking off for one or several vacations of random length. The cost structure consists of a holding cost rate specified by a general non-decreasing function of the queue size, fixed costs for initiating and terminating service, and a variable operating cost incurred for each unit of time that the system is in operation. We show under some weak conditions with respect to the holding cost rate function and the service time, vacation time and arrival batch size distributions that it is either optimal among all feasible (stationary and non-stationary) policies never to take a vacation, or it is optimal to take a vacation when the system empties out and to resume work when, upon completion of a vacation, the queue size is equal to or in excess of a critical threshold. These optimality results are generalized for several variants of this model.

[1]  Paul H. Zipkin,et al.  Evaluation of one-for-one replenishment policies for multiechelon inventory systems , 1991 .

[2]  Awi Federgruen,et al.  Optimal Maintenance Policies for Single-Server Queueing Systems Subject to Breakdowns , 1990, Oper. Res..

[3]  Linn I. Sennott,et al.  Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989, Oper. Res..

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

[5]  K. C. So,et al.  Optimal time to repair a broken server , 1989, Advances in Applied Probability.

[6]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

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

[8]  R. Weber,et al.  Optimal control of service rates in networks of queues , 1987, Advances in Applied Probability.

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

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

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

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

[13]  Arie Hordijk,et al.  Markov Decision Drift Processes; Conditions for Optimality Obtained by Discretization , 1985, Math. Oper. Res..

[14]  Arie Hordijk,et al.  Discretization and Weak Convergence in Markov Decision Drift Processes , 1984, Math. Oper. Res..

[15]  C. D. Litton,et al.  A First Course in Bulk Queues , 1983 .

[16]  Jeffrey L. Arthur.  Stochastic Models in Operations Research, Volume I. (Daniel P. Heyman and Matthew J. Sobel) , 1983 .

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

[18]  V. Kulkarni,et al.  A first course in bulk queues , 1983 .

[19]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[20]  Paul J. Schweitzer,et al.  The Functional Equations of Undiscounted Markov Renewal Programming , 1971, Math. Oper. Res..

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

[22]  O. J. Boxma,et al.  Note---Note on a Control Problem of Balachandran and Tijms , 1976 .

[23]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

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

[25]  Robert B. Cooper,et al.  Introduction to Queueing Theory , 1973 .

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

[27]  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..

[28]  Robert B. Cooper.  Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

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

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

[31]  Charles E. Skinner,et al.  A Priority Queuing System with Server-Walking Time , 1967, Oper. Res..

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