Maximizing throughput in finite-source parallel queue systems

Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system throughput as a Markov Decision Process. When the servers are homogeneous, we demonstrate that the Shortest Queue policy is optimal, and when the servers are heterogeneous, we partially characterize the optimal policy and present a near-optimal and simple-to-implement policy. We use the model to illustrate the substantial benefits of pooling, by comparing it to the permanent assignment of customers to servers.

[1]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[2]  Ashok K. Agrawala,et al.  Control of a Heterogeneous Two-Server Exponential Queueing System , 1983, IEEE Transactions on Software Engineering.

[3]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[4]  P. Sparaggis,et al.  Minimizing response times and queue lengths in systems of parallel queues , 1999 .

[5]  David G. Carmichael,et al.  Eriang loading models in earthmoving , 1986 .

[6]  E. Frostig.  Optimal policies for machine repairmen problems , 1993 .

[7]  Albert Y. Ha.  Optimal Dynamic Scheduling Policy for a Make-To-Stock Production System , 1997, Oper. Res..

[8]  Rhonda Righter.  Optimal policies for scheduling repairs and allocating heterogeneous servers , 1996 .

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

[10]  S. Albright.  Optimal maintenance-repair policies for the machine repair problem , 1980 .

[11]  Pieter Wartenhorst,et al.  N parallel queueing systems with server breakdown and repair , 1995 .

[12]  Susan H. Xu,et al.  Dynamic routing and jockeying controls in a two-station queueing system , 1996 .

[13]  Hajime Kawai,et al.  An assignment problem for a parallel queueing system with two heterogeneous servers , 1995 .

[14]  Ger Koole,et al.  On the Assignment of Customers to Parallel Queues , 1992, Probability in the Engineering and Informational Sciences.

[15]  David G. Carmichael,et al.  Shovel–truck queues: a reconciliation of theory and practice , 1986 .

[16]  Eytan Modiano,et al.  Routing over Parallel Queues with Time Varying Channels with Application to Satellite and Wireless Networks , 2001 .

[17]  J. George Shanthikumar,et al.  Optimal Dynamic Assignment of Customers to Heterogeneous Servers in Parallel , 1992, Oper. Res..

[18]  Ger Koole,et al.  On the Optimality of the Generalized Shortest Queue Policy , 1990, Probability in the Engineering and Informational Sciences.

[19]  Lani Haque,et al.  A survey of the machine interference problem , 2007, Eur. J. Oper. Res..

[20]  Wai-Ki Ching.  Machine repairing models for production systems , 2001 .

[21]  Lola Coleman Goheen,et al.  On the Optimal Operating Policy for the Machine Repair Problem When Failure and Repair Times Have Erlang Distribution , 1977, Oper. Res..

[22]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[23]  Laeeque K. Daneshmend,et al.  ECONOMIES OF SCALE IN MINING – ASSESSING UPPER BOUNDS WITH SIMULATION , 2000 .

[24]  Erhan Cinlar.  Optimal Operating Policy for the Machine Repair Problem with Two Service Stations. , 1972 .

[25]  Steven A. Lippman,et al.  Applying a New Device in the Optimization of Exponential Queuing Systems , 1975, Oper. Res..

[26]  Ger Koole,et al.  Routing to parallel homogeneous queues , 2005 .

[27]  Kuo-Hsiung Wang,et al.  Cost analysis of the M/M/R machine repair problem with balking, reneging, and server breakdowns , 1999, J. Oper. Res. Soc..