The Design of Distributed Service Systems

David R. Strip and Richard Engelbrecht-Wiggans
Additional contact information
David R. Strip: Sandia Laboratories, Albuquerque, New Mexico
Richard Engelbrecht-Wiggans: Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois

Operations Research, 1981, vol. 29, issue 5, 983-994

Abstract: A variety of practical situations involve supplying a particular commodity by some locations to satisfy the demand at others. If the demands and the costs of producing varying amounts of commodity at each location are known, then the question is how much commodity should be supplied by each location in order to minimize the total system cost. Under some relatively general conditions, there will be an optimal solution with the property that the vector of amounts supplied by the various locations is one of a distinguished set of points. In the case of star networks, this combinatorial nature may be exploited to give a very efficient algorithm for finding an optimal solution. A numerical example illustrates the results.

Keywords: 64; 183; 481 the design of distributed service systems (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.5.983 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:5:p:983-994

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().