Dynamic Scheduling of a Two-Class Queue with Setups

We analyze two scheduling problems for a queueing system with a single server and two customer classes. Each class has its own renewal arrival process, general service time distribution, and holding cost rate. In the first problem, a setup cost is incurred when the server switches from one class to the other, and the objective is to minimize the long-run expected average cost of holding customers and incurring setups. The setup cost is replaced by a setup time in the second problem, where the objective is to minimize the average holding cost. By assuming that a recently derived heavy traffic principle holds not only for the exhaustive policy but for nonexhaustive policies, we approximate (under standard heavy traffic conditions) the dynamic scheduling problems by diffusion control problems. The diffusion control problem for the setup cost problem is solved exactly, and asymptotics are used to analyze the corresponding setup time problem. Computational results show that the proposed scheduling policies are within several percent of optimal over a broad range of problem parameters.

[1]  Lawrence M. Wein,et al.  Optimal Control of a Two-Station Brownian Network , 2015, Math. Oper. Res..

[2]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[3]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network , 1993, Oper. Res..

[4]  S. Elmaghraby.  The Economic Lot Scheduling Problem (ELSP): Review and Extensions , 1978 .

[5]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[6]  Ioannis Karatzas,et al.  Brownian Motion and Stochastic Calculus , 1987 .

[7]  Edward G. Coffman,et al.  Polling Systems in Heavy Traffic: A Bessel Process Limit , 1998, Math. Oper. Res..

[8]  H. Kushner.  Numerical Methods for Stochastic Control Problems in Continuous Time , 2000 .

[9]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..

[10]  Ger Koole,et al.  Asigning a Single Server to Inhomogeneous Queues with Switching Costs , 1997, Theor. Comput. Sci..

[11]  P. Mandl.  Analytical treatment of one-dimensional Markov processes , 1968 .

[12]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..

[13]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs , 1990, Oper. Res..

[14]  David Maxwell Markowitz.  A unified approach to single machine scheduling : heavy traffic analysis of dynamic cyclic policies , 1996 .

[15]  M. Reiman,et al.  Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle , 1995 .

[16]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[17]  Hanoch Levy,et al.  Efficient visit frequencies for polling tables: minimization of waiting cost , 1991, Queueing Syst. Theory Appl..

[18]  李幼升,et al.  Ph , 1989 .

[19]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

[20]  高木 英明,et al.  Analysis of polling systems , 1986 .

[21]  Micha Hofri,et al.  On the Optimal Control of Two Queues with Server Setup Times and its Analysis , 1987, SIAM J. Comput..

[22]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[23]  Izak Duenyas,et al.  Stochastic scheduling of parallel queues with set-up costs , 1995, Queueing Syst. Theory Appl..

[24]  Dimitris Bertsimas,et al.  Optimization of Polling Systems and Dynamic Vehicle Routing Problems on Networks , 1993 .

[25]  Izak Duenyas,et al.  Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups , 1996 .