Advances in Applied Probability
- Adv. in Appl. Probab.
- Volume 47, Number 2 (2015), 450-475.
Staffing many-server systems with admission control and retrials
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 difficult 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. In this paper we develop many-server asymptotics in the so-called quality and efficiency driven regime, and present refinements to many-server asymptotics and square-root staffing for a Markovian queueing model with admission control and retrials.
Adv. in Appl. Probab., Volume 47, Number 2 (2015), 450-475.
First available in Project Euclid: 25 June 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 60K25: Queueing theory [See also 68M20, 90B22] 68M10: Network design and communication [See also 68R10, 90B18] 41A60: Asymptotic approximations, asymptotic expansions (steepest descent, etc.) [See also 30E15]
Janssen, A. J. E. M.; van Leeuwaarden, J. S. H. Staffing many-server systems with admission control and retrials. Adv. in Appl. Probab. 47 (2015), no. 2, 450--475. doi:10.1239/aap/1435236983. https://projecteuclid.org/euclid.aap/1435236983