Optimal Server Allocation in a System of Multi-Server Stations

Jevaveerasingam Shanthikumar and David Yao

Management Science, 1987, vol. 33, issue 9, 1173-1180

Abstract: Consider a closed queueing network (Gordon and Newell [Gordon, W. J., G. F. Newell. 1967. Closed queueing networks with exponential servers. Oper. Res. 15 252--267.]) with a set of stations. The service rate at each station is an increasing concave function of the number of jobs at that station. Suppose there also exists a station that has c (\ge 1) parallel servers, each of which has a fixed service rate. We show that the throughput of this network is an increasing concave function with respect to c. This result is then applied to solve the optimal server allocation problem in a system of multi-server stations with a fixed buffer capacity (for the total number of jobs) at each station. For a single-station system, the simultaneous optimal allocation of both servers and buffer capacity is also studied.

Keywords: closed queueing network; concavity of throughput; optimal server/buffer allocation (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.33.9.1173 (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:33:y:1987:i:9:p:1173-1180

Access Statistics for this article

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