Staffing many-server systems with admission control and retrials
From MaRDI portal
Publication:5262449
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.
Recommendations
- Staffing call centers with impatient customers: refinements to many-server asymptotics
- Asymptotically optimal staffing of service systems with joint QoS constraints
- Dimensioning Large Call Centers
- Queue-and-idleness-ratio controls in many-server service systems
- Staffing many-server queues with impatient customers: constraint satisfaction in call centers
Cites work
- scientific article; zbMATH DE number 4215340 (Why is no real title available?)
- scientific article; zbMATH DE number 3513051 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- Asymptotic Behavior of Total Times for Jobs That Must Start Over if a Failure Occurs
- Characterizing heavy-tailed distributions induced by retransmissions
- Distribution of the number of retransmissions of bounded documents
- Implicit renewal theorem for trees with general weights
- Modulated branching processes, origins of power laws, and queueing duality
Cited in
(4)
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)
