A simple load balancing problem with decentralized information

The following load balancing problem is investigated in discrete time: A service system consists of two service stations and two controllers, one in front of each station. The service stations provide the same service with identical service time distributions and identical waiting costs. Customers requiring service arrive at a controller's site and are routed to one of the two stations by the controller. The processes describing the two arrival streams are identical. Each controller has perfect knowledge of the workload in its own station and receives information about the other station's workload with one unit of delay. The controllers' routing strategies that minimize the customers' total flowtime are determined for a certain range of the parameters that describe the arrival process and the service distribution. Specifically, we prove that optimal routing strategies are characterized by thresholds that are either precisely specified or take one of two possible values.

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

[2]  D. Teneketzis,et al.  A simple load balancing problem with decentralized information , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[3]  H. Witsenhausen Separation of estimation and control for discrete time systems , 1971 .

[4]  Jr. Shaler Stidham Optimal control of admission to a queueing system , 1985 .

[5]  J. H. van Schuppen,et al.  Distributed routing for load balancing , 1988 .

[6]  D. Teneketzis,et al.  Routing in queueing networks under imperfect information: stochastic dominance and thresholds , 1989 .

[7]  Cheng-Shang Chang,et al.  A new ordering for stochastic majorization: theory and applications , 1992, Advances in Applied Probability.

[8]  B. Hajek Optimal control of two interacting service stations , 1982, 1982 21st IEEE Conference on Decision and Control.

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

[10]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[11]  J. Walrand,et al.  On delayed sharing patterns , 1978 .

[12]  S. Stidham,et al.  Individual versus Social Optimization in the Allocation of Customers to Alternative Servers , 1983 .

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

[14]  Jean Walrand,et al.  A note on optimal control of a queuing system with two heterogeneous servers , 1984 .

[15]  John N. Tsitsiklis,et al.  Optimal distributed policies for choosing among multiple servers , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[16]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[17]  P. R. Kumar,et al.  Optimal control of a queueing system with two heterogeneous servers , 1984 .

[18]  Bruce E. Hajek,et al.  Performance of global load balancing of local adjustment , 1990, IEEE Trans. Inf. Theory.

[19]  Susan H. Xu Socially and Individually Optimal Routing of Stochastic Jobs in Parallel Processor Systems , 1992, Oper. Res..

[20]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..