Multi-Server Queueing with Surge Analysis & Recovery Dynamics
The M/M/c queue represents the canonical multi-server system with Markovian (memoryless) arrivals and Markovian service times, serving c parallel servers. This model assumes unlimited waiting capacity—patients can queue indefinitely.
System stability requires that total service capacity exceeds arrival rate:
Where ρ is the system utilization factor. When ρ ≥ 1, the queue grows without bound.
The probability that an arriving customer must wait (all servers busy) is given by Erlang's C formula:
Where P₀ is the probability all servers are idle:
For those who must wait, the average queue time is:
Operational Context:
Analysis: Utilization ρ = 12/(3×4) = 1.0 → UNSTABLE! The system is at critical threshold. Small fluctuations create unbounded queues.
Operational Context:
Analysis: Utilization ρ = 180/(7×30) = 0.86. Operating near the "elbow"—adding 1 inspector dramatically reduces queue length.
Operational Context:
Analysis: Utilization ρ = 240/(25×12) = 0.80. Adequate for steady-state but vulnerable to surge events (product launches, outages).
Run ensemble simulations (60 parallel realities) to analyze queue behavior under various conditions. Test multiple shock scenarios (2×, 3×, 5× surge arrivals) and visualize system dynamics including queue evolution and recovery time.
Test system resilience with surge scenarios (elevated arrivals from hour 10-12)
< 70%: Low stress, highly responsive
70-85%: Efficient, manageable volatility
85-95%: High volatility, vulnerable to shocks
≥ 95%: Extreme wait times, system fragility
Narrow spread: Predictable performance across scenarios
Wide spread: High operational volatility—some realities perform well, others catastrophically
The 95th percentile reveals your "worst case" planning scenario.
Adding servers reduces wait times with diminishing returns. The elbow is where marginal benefit drops sharply.
Before elbow: Each server dramatically improves performance
After elbow: Minimal improvement per additional server