Service staffing with delay probabilities

DOI10.1016/J.ORL.2023.03.016MaRDI QIDQ6106546zbMATH OpenOpenAlexFDO

Authors Lonnie jun. Turpin

Publication date 3 July 2023

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2023.03.016

zbMATH Keywords

\(M/M/s\) queueErlang-Cservice levelsquare-root staffing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• Refining square-root safety staffing by expanding Erlang C
• Staffing to stabilize the tail probability of delay in service systems with time-varying demand
• Server Staffing to Meet Time-Varying Demand
• Staffing large-scale service systems with distributional uncertainty
• Staffing to stabilize blocking in loss models with time-varying arrival rates

Cites work

• An approximation formula L_q^ /(1-)
• Approximations for multi-server queues: System interpolations
• Dimensioning Large Call Centers
• Dynamic rate Erlang-A queues
• Fleet coordination in decentralized Humanitarian operations funded by earmarked donations
• Heavy-Traffic Limits for Queues with Many Exponential Servers
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Refining square-root safety staffing by expanding Erlang C
• Refining the Diffusion Approximation for the M/G/m Queue
• Setting staffing requirements for time dependent queueing networks: the case of accident and emergency departments
• Sharp Bounds and Simple Approximations for the Erlang Delay and Loss Formulas
• Understanding the Efficiency of Multi-Server Service Systems
• What you should know about queueing models to set staffing requirements in service systems

Cited in

(6)

• Staffing large-scale service systems with distributional uncertainty
• scientific article; zbMATH DE number 3950175 (Why is no real title available?)
• Server Staffing to Meet Time-Varying Demand
• Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems
• STAFFING A SERVICE SYSTEM WITH NON-POISSON NON-STATIONARY ARRIVALS
• Some asymptotic properties of the Erlang-C formula in many-server limiting regimes

This page was built for publication: Service staffing with delay probabilities

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