A simple load balancing problem with decentralized information
dc.contributor.author | Pandelis, Dimitrios G. | en_US |
dc.contributor.author | Teneketzis, Demosthenis | en_US |
dc.date.accessioned | 2006-09-11T16:31:55Z | |
dc.date.available | 2006-09-11T16:31:55Z | |
dc.date.issued | 1996-02 | en_US |
dc.identifier.citation | Pandelis, Dimitrios G.; Teneketzis, Demosthenis; (1996). "A simple load balancing problem with decentralized information." Mathematical Methods of Operations Research 44(1): 97-113. <http://hdl.handle.net/2027.42/45840> | en_US |
dc.identifier.issn | 1432-5217 | en_US |
dc.identifier.issn | 1432-2994 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/45840 | |
dc.description.abstract | 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. | en_US |
dc.format.extent | 655034 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Physica-Verlag; Springer Science+Business Media | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Business/Management Science, General | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.title | A simple load balancing problem with decentralized information | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Electrical Engineering and Computer Science, University of Michigan, 48109-2122, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Environmental Research Institute of Michigan, 3300 Plymouth Rd., 48105, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/45840/1/186_2005_Article_BF01246331.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01246331 | en_US |
dc.identifier.source | Mathematical Methods of Operations Research | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.