Staffing many-server systems with admission control and retrials
Probability
2014-01-30 v2
Abstract
In many-server systems it is crucial to staff the right number of servers so that targeted service levels are met. These staffing problems typically lead to constraint satisfaction problems that are hard to solve. During the last decade, a powerful many-server asymptotic theory has been developed to solve such problems and optimal staffing rules are known to obey the square-root staffing principle. This paper develops many-server asymptotics in the so-called QED regime, and presents refinements to many-server asymptotics and square-root staffing for a Markovian queueing model with admission control and retrials.
Keywords
Cite
@article{arxiv.1302.3006,
title = {Staffing many-server systems with admission control and retrials},
author = {A. J. E. M. Janssen and Johan S. H. van Leeuwaarden},
journal= {arXiv preprint arXiv:1302.3006},
year = {2014}
}
Comments
This is a longer report version of a paper which is under submission