OPTIMAL SERVER ALLOCATION IN A SYSTEM OF MULTI-SERVER STATIONS

J. George Shanthikumar; David D. Yao

doi:10.1287/mnsc.33.9.1173

OPTIMAL SERVER ALLOCATION IN A SYSTEM OF MULTI-SERVER STATIONS

J. George Shanthikumar
, David D. Yao

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

97 Citations (Scopus)

Abstract

Consider a closed queueing network 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 ( greater than equivalent to 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.

© 1987, The Institute of Management Sciences

Original language	English
Pages (from-to)	1173-1180
Journal	Management Science
Volume	33
Issue number	9
DOIs	https://doi.org/10.1287/mnsc.33.9.1173
Publication status	Published - Sept 1987
Externally published	Yes

Access Output

10.1287/mnsc.33.9.1173

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{8e1f3e3c7a284480ac9c7431136c3ae5,

title = "OPTIMAL SERVER ALLOCATION IN A SYSTEM OF MULTI-SERVER STATIONS",

abstract = "Consider a closed queueing network 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 ( greater than equivalent to 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. {\textcopyright} 1987, The Institute of Management Sciences",

author = "Shanthikumar, \{J. George\} and Yao, \{David D.\}",

year = "1987",

month = sep,

doi = "10.1287/mnsc.33.9.1173",

language = "English",

volume = "33",

pages = "1173--1180",

journal = "Management Science",

issn = "0025-1909",

publisher = "Institute for Operations Research and the Management Sciences (INFORMS)",

number = "9",

}

TY - JOUR

T1 - OPTIMAL SERVER ALLOCATION IN A SYSTEM OF MULTI-SERVER STATIONS

AU - Shanthikumar, J. George

AU - Yao, David D.

PY - 1987/9

Y1 - 1987/9

N2 - Consider a closed queueing network 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 ( greater than equivalent to 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. © 1987, The Institute of Management Sciences

AB - Consider a closed queueing network 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 ( greater than equivalent to 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. © 1987, The Institute of Management Sciences

UR - https://www.scopus.com/pages/publications/0023411524

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0023411524&origin=recordpage

U2 - 10.1287/mnsc.33.9.1173

DO - 10.1287/mnsc.33.9.1173

M3 - RGC 21 - Publication in refereed journal

SN - 0025-1909

VL - 33

SP - 1173

EP - 1180

JO - Management Science

JF - Management Science

IS - 9

ER -

OPTIMAL SERVER ALLOCATION IN A SYSTEM OF MULTI-SERVER STATIONS

Abstract

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this