Lookup NU author(s): Dr Joris Slegers,
Emeritus Professor Isi Mitrani,
Dr Nigel Thomas
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
A system consisting of a number of servers, where demands of different types arrive in bursts (modelled by interrupted Poisson processes), is examined in the steady state. The problem is to decide how many servers to allocate to each job type, so as to minimize a cost function expressed in terms of average queue sizes. First, an exact analysis is provided for an isolated IPP/M/n queue. The results are used to compute the optimal static server allocation policy. The latter is then compared to four heuristic policies which employ dynamic switching of servers from one queue to another (such switches take time and hence incur costs). © 2008 Springer Science+Business Media, LLC.
Author(s): Slegers J, Mitrani I, Thomas N
Publication type: Article
Publication status: Published
Journal: Annals of Operations Research
ISSN (print): 0254-5330
ISSN (electronic): 1572-9338
Publisher: Springer New York LLC
Altmetrics provided by Altmetric