论文信息 - Optimal scheduling in heterogeneous two-station queueing networks

Optimal scheduling in heterogeneous two-station queueing networks

Abstract. We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order to minimize the linear holding cost of the system. We will treat the discounted as well as the average cost criterion. In both cases we can prove that the optimal policy is a switching-curve policy. A numerical sensitivity analysis is also presented.

Nicole Bäuerle | Gabi Brüstl | Ulrich Rieder

[1] Shaler Stidham,et al. Scheduling, Routing, and Flow Control in Stochastic Networks , 1988 .

[2] David D. Yao,et al. Monotone Optimal Control of Permutable GSMPs , 1994, Math. Oper. Res..

[3] Hong Chen,et al. Control and scheduling in a two-station queueing network: Optimal policies and heuristics , 1994, Queueing Syst. Theory Appl..

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

[5] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[6] J. Dai. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[7] Shaler Stidham,et al. A survey of Markov decision models for control of networks of queues , 1993, Queueing Syst. Theory Appl..

[8] R. Hariharan,et al. Scheduling in a multi-class series of queues with deterministic service times , 1996, Queueing Syst. Theory Appl..

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