Affordable Access

A simple load balancing problem with decentralized information

Mathematical Methods of Operations Research
Publication Date


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.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

Decentralized dynamic load balancing: The particle...

on Information Sciences Jan 01, 1995

A decentralized algorithm for dynamic load balanci...

on Journal of Systems and Softwar... Jan 01, 1991

Load Balancing

on International Journal of Resea... January 2016
More articles like this..