Excursion-based universal approximations for the Erlang-A queue in steady-state

DOI10.1287/MOOR.2013.0606MaRDI QIDQ5169704zbMATH OpenOpenAlexFDO

Authors Itai Gurvich, Junfei Huang, Avishai Mandelbaum

Publication date 11 July 2014

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2eb1086252284cfb8929475b14db0f0735f96dc2

zbMATH Keywords

birth-death processdiffusion approximationqueueing systemsteady-state

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17) Diffusion processes (60J60) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Renewal theory (60K05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• New perspectives on the Erlang-A queue
• Dynamic rate Erlang-A queues
• A Diffusion Approximation for the G/GI/n/m Queue
• Approximations for chat service systems using many-server diffusion limits
• scientific article; zbMATH DE number 3864257

Cited in

(14)

• Dynamic rate Erlang-A queues
• On the distributions of infinite server queues with batch arrivals
• Managing capacity and inventory jointly for multi-server make-to-stock queues
• A unified approach to diffusion analysis of queues with general patience-time distributions
• Data-stories about (im)patient customers in tele-queues
• Diffusion models and steady-state approximations for exponentially ergodic Markovian queues
• Beyond Heavy-Traffic Regimes: Universal Bounds and Controls for the Single-Server Queue
• Transform methods for heavy-traffic analysis
• New perspectives on the Erlang-A queue
• Economies-of-scale in many-server queueing systems: tutorial and partial review of the QED Halfin-Whitt heavy-traffic regime
• The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates
• Universally optimal staffing of Erlang-A queues facing uncertain arrival rates
• The number of overlapping customers in Erlang-A queues: an asymptotic approach
• Universally optimal staffing for Erlang-A queues facing uncertain arrival rates: the case of constraint satisfaction

This page was built for publication: Excursion-based universal approximations for the Erlang-A queue in steady-state

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