Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network

We consider the problem of finding an optimal dynamic priority sequencing policy to maximize the mean throughput rate in a multistation, multiclass closed queueing network with general service time distributions and a general routing structure. Under balanced heavy loading conditions, this scheduling problem can be approximated by a control problem involving Brownian motion. Although a unique, closed-form solution to the Brownian control problem is not derived, an analysis of the problem leads to an effective static sequencing policy, and to an approximate means of comparing the relative performance of arbitrary static policies. Several examples are provided that illustrate the effectiveness of our procedure.

[1]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

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

[3]  Ruth J. Williams,et al.  Conformal mapping solution of Laplace's equation on a polygon with oblique derivative boundary conditions , 1986 .

[4]  J. Harrison,et al.  The Stationary Distribution of Reflected Brownian Motion in a Planar Region , 1985 .

[5]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[6]  Lawrence M. Wein,et al.  The Impact of Processing Time Knowledge on Dynamic Job-Shop Scheduling , 1991 .

[7]  Martin I. Reiman,et al.  A network of priority queues in heavy traffic: One bottleneck station , 1990, Queueing Syst. Theory Appl..

[8]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

[9]  I. Karatzas.  A class of singular stochastic control problems , 1983, Advances in Applied Probability.

[10]  Lawrence M. Wein,et al.  Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..

[11]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[12]  J. Harrison.  A limit theorem for priority queues in heavy traffic , 1973, Journal of Applied Probability.

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

[14]  Philippe B. Chevalier.  Two topics in multistage manufacturing systems , 1992 .

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

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

[17]  L. F. Martins,et al.  Numerical Methods for Stochastic Singular Control Problems , 1991 .

[18]  William P. Peterson,et al.  A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types , 1991, Math. Oper. Res..

[19]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[20]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

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

[22]  Michael I. Taksar,et al.  Average Optimal Singular Control and a Related Stopping Problem , 1985, Math. Oper. Res..