On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks

Yves Dallery and Kathryn E. Stecke
Additional contact information
Yves Dallery: Université Pierre et Marie Curie, Paris, France
Kathryn E. Stecke: University of Michigan, Ann Arbor, Michigan

Operations Research, 1990, vol. 38, issue 4, 694-703

Abstract: In this paper, properties are derived that are useful for characterizing optimal allocations of servers and workloads in single-class, multiserver closed queueing networks (CQNs). The problem is as follows: Suppose a particular workload is allocated to a set of servers within a subnetwork of a CQN. This set of servers is to be partitioned into several multiserver stations. The number of stations, the number of servers, and the workload allocation to each station define a configuration of this subnetwork. Thus, the problem is to determine the best configuration of each subnetwork to maximize the throughput in the original CQN. Decomposition is used to address this problem. Results are obtained for subnetworks in isolation. These results are used to solve the optimal-configuration problem. Applications of the results to design and planning problems of flexible manufacturing are also described.

Keywords: queues: closed queueing networks; inventory/production: flexible manufacturing (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.38.4.694 (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:38:y:1990:i:4:p:694-703

Access Statistics for this article

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