Many‐server loss models with non‐poisson time‐varying arrivals

DOI10.1002/NAV.21741zbMath1411.90104OpenAlexW2617402772WikidataQ57404043 ScholiaQ57404043MaRDI QIDQ4632967

Jingtong Zhao, Ward Whitt

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21741

zbMATH Keywords

approximationcapacity planningqueues with time-varying arrival ratesmodified offered loadnon-Poisson nonstationary arrival processesnonstationary loss modelsstaffing a service system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (6)

Delay-Based Service Differentiation with Many Servers and Time-Varying Arrival Rates ⋮ An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis ⋮ Dynamic rate Erlang-A queues ⋮ Time-dependent analysis for a two-processor heterogeneous system with time-varying arrival and service rates ⋮ Staffing to Stabilize the Tail Probability of Delay in Service Systems with Time-Varying Demand ⋮ A many-server functional strong law for a non-stationary loss model

This page was built for publication: Many‐server loss models with non‐poisson time‐varying arrivals