Optimal Workload Allocation in Open Networks of Multiserver Queues

Joel M. Calabrese
Additional contact information
Joel M. Calabrese: Department of Business Analysis and Computing Systems, San Francisco State University, San Francisco, California 94132

Management Science, 1992, vol. 38, issue 12, 1792-1802

Abstract: In this paper, we examine the general problem of workload allocation in an open Jackson network of multiserver queues. We show that use of the open network model leads to a separable, convex formulation of the problem with relatively simple optimality conditions. Using these conditions, we prove in general that server groups with the same number of servers should be loaded equally and larger groups should be loaded more heavily than smaller groups. It is also shown that server pooling, combining servers into larger groups, will always reduce congestion and/or increase throughput. We discuss the significance of our results for job shop applications and also for the concept of a production bottleneck. In systems with an unbalanced configuration of servers, traditional, deterministic bottleneck analysis is distinctly nonoptimal; our results provide a simple way to locate production bottlenecks in shops with significant queueing effects.

Keywords: networks of queues; network design; workload balancing; bottle-neck analysis; flexible manufacturing systems (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.12.1792 (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:ormnsc:v:38:y:1992:i:12:p:1792-1802

Access Statistics for this article

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