Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Management Science
Article . 1987 . Peer-reviewed
Data sources: Crossref
Management Science
Article
Data sources: Microsoft Academic Graph
Research Papers in Economics
Article . 1987
Data sources: Research Papers in Economics
 View all 3 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Optimal Server Allocation in a System of Multi-Server Stations

Optimal server allocation in a system of multi-server stations
descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1987 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 33, pages 1,173-1,180 (issn: 0025-1909, eissn: 1526-5501, Copyright policy )
Authors: J. George Shanthikumar; David D. Yao;

doi: 10.1287/mnsc.33.9.1173

Optimal Server Allocation in a System of Multi-Server Stations

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 (≥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.

Related Organizations
Keywords

optimal server allocation, fixed buffer capacity, set of stations, parallel servers, closed queueing network, concavity of throughput, optimal server/buffer allocation, closed queueing network, Queues and service in operations research, Queueing theory (aspects of probability theory)

  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 113
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
113
Top 10%
Top 1%
Top 10%
Upload OA version
Are you the author? Do you have the OA version of this publication?
uploadUpload now!