When Should Temporary Capacity Be Added? Optimal Timing of Short-Duration Staffing Boosts in Time-Varying Queues, and Why Fluid Approximations Overstate the Benefit

Service systems facing a predictable demand peak (a lunch rush, a call-center surge) often respond by temporarily adding capacity — a second cashier, an extra agent — for a fixed duration during the busy period. The standard heuristic is to center this temporary capacity on the demand peak. We show, both analytically via a deterministic fluid approximation and computationally via discrete-event simulation of the underlying stochastic M_t/M/c(t) queue, that this heuristic is measurably suboptimal in most of the parameter regimes we study: because a queue that has already built up takes time to drain, the total-customer-wait-minimizing window is typically shifted later than the demand peak, not centered on it. Across three demand-shape/budget-duration scenarios, a properly randomized, variance-reduced discrete-event simulation (600–1,500 replications with common random numbers) confirms this direction and finds it statistically significant in every case, while a matched deterministic fluid approximation overstates the magnitude of the benefit by a factor of roughly 7–12× in every scenario tested. This overstatement is consistent with, and gives a concretely quantified instance of, existing asymptotic theory showing that fluid and pointwise-stationary approximations for time-varying queues are only exact in the large-rate (many-server) limit; our moderate-scale, single-server setting is exactly where that theory predicts such approximations should be least reliable. We also identify a boundary regime (a narrow demand peak combined with a long capacity budget) in which the direction of the optimal shift reverses, underscoring that the heuristic's failure mode is itself regime-dependent.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-04
DOI
https://doi.org/10.5281/zenodo.22287402
Primary Topic
Advanced Queuing Theory Analysis
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

When Should Temporary Capacity Be Added? Optimal Timing of Short-Duration Staffing Boosts in Time-Varying Queues, and Why Fluid Approximations Overstate the Benefit

Amirhossein MoradiSizkouhi
Zenodo (CERN European Organization for Nuclear Research)
Advanced Queuing Theory Analysis
preprint

When Should Temporary Capacity Be Added? Optimal Timing of Short-Duration Staffing Boosts in Time-Varying Queues, and Why Fluid Approximations Overstate the Benefit

Amirhossein MoradiSizkouhi
preprint en

Abstract

Service systems facing a predictable demand peak (a lunch rush, a call-center surge) often respond by temporarily adding capacity — a second cashier, an extra agent — for a fixed duration during the busy period. The standard heuristic is to center this temporary capacity on the demand peak. We show, both analytically via a deterministic fluid approximation and computationally via discrete-event simulation of the underlying stochastic M_t/M/c(t) queue, that this heuristic is measurably suboptimal in most of the parameter regimes we study: because a queue that has already built up takes time to drain, the total-customer-wait-minimizing window is typically shifted later than the demand peak, not centered on it. Across three demand-shape/budget-duration scenarios, a properly randomized, variance-reduced discrete-event simulation (600–1,500 replications with common random numbers) confirms this direction and finds it statistically significant in every case, while a matched deterministic fluid approximation overstates the magnitude of the benefit by a factor of roughly 7–12× in every scenario tested. This overstatement is consistent with, and gives a concretely quantified instance of, existing asymptotic theory showing that fluid and pointwise-stationary approximations for time-varying queues are only exact in the large-rate (many-server) limit; our moderate-scale, single-server setting is exactly where that theory predicts such approximations should be least reliable. We also identify a boundary regime (a narrow demand peak combined with a long capacity budget) in which the direction of the optimal shift reverses, underscoring that the heuristic's failure mode is itself regime-dependent.

Zenodo (CERN European Organization for Nuclear Research)
Imam Khomeini International University (IR)
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.