Optimal server allocation in general, finite, multi‐server queueing networks

J. MacGregor Smith, F. R. B. Cruz and T. van Woensel

Applied Stochastic Models in Business and Industry, 2010, vol. 26, issue 6, 705-736

Abstract: Queueing networks with finite buffers, multiple servers, arbitrary acyclic, series‐parallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonstrated. The methodology builds on two‐moment approximations to the service time distribution embedded in the generalized expansion method for computing the performance measures in complex finite queueing networks and Powell's algorithm for optimally allocating servers to the network topology. Convexity of the objective function along with results from computational experiments is presented for showing the efficacy of the methodology. Copyright © 2009 John Wiley & Sons, Ltd.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/asmb.813

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:wly:apsmbi:v:26:y:2010:i:6:p:705-736

Access Statistics for this article

More articles in Applied Stochastic Models in Business and Industry from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().