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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
