Optimal Control of a Multiclass, Flexible Queueing System

We consider a general class of queueing systems with multiple job types and a flexible service facility. The arrival times and sizes of incoming jobs are random, and correlations among the sizes of arriving job types are allowed. By choosing among a finite set of configurations, the facility can dynamically control the rates at which it serves the various job types. We define system work at any given time as the minimum time required to process all jobs currently in the backlog. This quantity is determined by solving a linear program defined by the set of processing configurations. The problem we study is how to dynamically choose configurations to minimize the time average system work. Using bounds and heuristics, we analyze a class of service policies that is provably asymptotically optimal as system utilization approaches one, as well as a policy that in numerical studies performs near-optimally in moderate traffic. Our analysis also yields a closed-form expression for the optimal, average work in heav...

[1]  R. Akella,et al.  Optimal control of production rate in a failure prone manufacturing system , 1985, 1985 24th IEEE Conference on Decision and Control.

[2]  J. S. Kaufman,et al.  A Conservation Law Based Approximate Analysis For a Class of Simultaneous Resource Possession Problems , 1989, Perform. Evaluation.

[3]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[4]  Lawrence M. Wein,et al.  Dynamic Scheduling of a Multiclass Make-to-Stock Queue , 2015, Oper. Res..

[5]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[6]  Edward G. Coffman,et al.  Probabilistic analysis of packing and partitioning algorithms , 1991, Wiley-Interscience series in discrete mathematics and optimization.

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

[8]  Linda V. Green,et al.  A Multiple Dispatch Queueing Model of Police Patrol Operations , 1984 .

[9]  Edward D. Lazowska,et al.  Analyzing queueing networks with simultaneous resource possession , 1982, CACM.

[10]  Linda V. Green.  Comparing Operating Characteristics of Queues in Which Customers Require a Random Number of Servers , 1981 .

[11]  Costas Courcoubetis,et al.  Optimal control of a queueing system with simultaneous service requirements , 1987 .

[12]  Linda Green,et al.  A Queueing System in Which Customers Require a Random Number of Servers , 1980, Oper. Res..

[13]  Lawrence M. Wein,et al.  A Dynamic Stochastic Stock-Cutting Problem , 2015, Oper. Res..

[14]  Qing Zhang,et al.  Hierarchical Decision Making in Stochastic Manufacturing Systems , 1994 .

[15]  Uriel G. Rothblum,et al.  On Optimal Packing of Randomly Arriving Objects , 1991, Math. Oper. Res..

[16]  Percy H. Brill,et al.  Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach , 1984 .

[17]  J. George Shanthikumar,et al.  Design of manufacturing systems using queueing models , 1992, Queueing Syst. Theory Appl..

[18]  Gabriel R. Bitran,et al.  A review of open queueing network models of manufacturing systems , 1992, Queueing Syst. Theory Appl..

[19]  M. Balinski,et al.  On an Integer Program for a Delivery Problem , 1964 .

[20]  Hanif D. Sherali,et al.  Linear programming and network flows (2nd ed.) , 1990 .

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

[22]  Antonio Sassano,et al.  A Lagrangian-based heuristic for large-scale set covering problems , 1998, Math. Program..

[23]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[24]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[25]  W. Whitt.  Planning queueing simulations , 1989 .

[26]  Abraham Charnes,et al.  A MODEL FOR THE OPTIMAL PROGRAMMING OF RAILWAY FREIGHT TRAIN MOVEMENTS , 1956 .

[27]  Stanley B. Gershwin,et al.  Manufacturing Systems Engineering , 1993 .

[28]  Costas Courcoubetis,et al.  Stability of Flexible Manufacturing Systems , 1994, Oper. Res..

[29]  Awi Federgruen,et al.  AN MIGIc QUEUE IN WHICH THE NUMBER OF SERVERS REQUIRED IS , 1984 .

[30]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[31]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[32]  Linda V. Green,et al.  A Queueing System with Auxiliary Servers , 1984 .

[33]  Charles H. Sauer,et al.  Approximate Solution of Queueing Networks with Simultaneous Resource Possession , 1981, IBM J. Res. Dev..

[34]  J. Walrand,et al.  Scheduling and stability aspects of a general class of parallel processing systems , 1993, Advances in Applied Probability.

[35]  Awi Federgruen,et al.  An M/G/c queue in which the number of servers required is random , 1984 .

[36]  Linda Green,et al.  A Queueing System with General-Use and Limited-Use Servers , 1985, Oper. Res..

[37]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[38]  Stanley B. Gershwin,et al.  An algorithm for the computer control of a flexible manufacturing system , 1983 .

[39]  David D. Yao,et al.  Monotonicity properties for the stochastic knapsack , 1990, IEEE Trans. Inf. Theory.

[40]  Costas Courcoubetis,et al.  Stability of a Queueing System with Concurrent Service and Locking , 1987, SIAM J. Comput..