Staffing many-server systems with admission control and retrials

From MaRDI portal
Publication:5262449

DOI10.1239/AAP/1435236983zbMATH Open1318.60091arXiv1302.3006OpenAlexW1571543401MaRDI QIDQ5262449FDOQ5262449

Johan S. H. van Leeuwaarden, A. J. E. M. Janssen

Publication date: 15 July 2015

Published in: Advances in Applied Probability (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1302.3006




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Staffing many-server systems with admission control and retrials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262449)