Queuing Theory in Healthcare
Queuing Theory for Healthcare Service Management and Wait Time Analysis · Also known as: Healthcare Queuing, Queue Management Healthcare
Queuing theory is a mathematical discipline that models waiting lines, service capacity, and customer (patient) flow. Developed initially by Agner Erlang for telecommunications in 1909, it has been extensively applied to healthcare to analyze and optimize emergency departments, outpatient clinics, surgical suites, and diagnostic service centers.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use queuing theory when analyzing service systems with variable demand and fixed capacity, such as emergency departments, outpatient clinics, and diagnostic services. It is effective for predicting system behavior without expensive simulation. Assume that arrivals and service times are random, that the system is in steady state (not in startup or shutdown), and that queue discipline is clear (FIFO, priority). Avoid queuing theory if arrival patterns are highly deterministic, if the system is very small (< 3 servers), or if non-standard queue disciplines make analysis intractable.
Strengths & limitations
- Provides closed-form formulas for waiting times, queue lengths, and utilization with minimal data
- Allows rapid scenario analysis and 'what-if' studies (e.g., adding a provider reduces wait time by how much?)
- Identifies bottlenecks and optimal staffing levels for given service targets
- Well-established theory with extensive literature and software implementations
- Low computational cost compared to simulation
- Standard queuing models assume random (Poisson) arrivals and exponential service times, which often do not hold in healthcare
- Does not account for patient abandonment, reneging, or complex routing patterns
- Assumes stationary conditions; does not handle time-varying demand (e.g., seasonal variation)
- Results are sensitive to assumption about distribution shape; small errors in assumptions can lead to large prediction errors
- Limited ability to model interaction between multiple service stations or priority policies
Frequently asked
What is the M/M/1 queue and when is it used?
M/M/1 represents a single-server queue with Markovian (exponential) arrival and service time distributions. It is appropriate for modeling a single check-in clerk, a lone imaging scanner, or a single provider when demand is not too high. Its formula for average wait time is W = λ / (μ(μ − λ)), where λ is arrival rate and μ is service rate.
How does adding one more provider reduce wait time?
The effect is nonlinear and depends on current utilization. At low utilization (e.g., 30% server busy), adding capacity has minimal impact. At high utilization (e.g., 85% busy), adding one server can cut wait time dramatically. This is why healthcare systems often run near full capacity and see long waits.
Can I use queuing theory if patients arrive by appointment?
Partially. Scheduled arrivals reduce randomness and are more predictable, but appointment systems still have no-shows, cancellations, and variable service times. A hybrid model (some scheduled, some walk-in) is common in healthcare. If arrivals are highly deterministic (all appointments), simulation may be better.
What does 'utilization' mean and how does it affect wait time?
Utilization (ρ = λ / (c × μ)) is the fraction of server capacity being used. A 70% utilization means providers are busy 70% of the time. As utilization approaches 100%, wait times increase exponentially. Most healthcare systems aim for 70–85% utilization to balance efficiency and service levels.
How do I choose between adding staff vs. improving efficiency (reducing service time)?
Both reduce wait time, but efficiency improvements are often cheaper and more sustainable. Reducing average service time by 10% has similar effect to hiring more staff but without long-term salary costs. Prioritize process improvement first, then add capacity if needed.
Sources
- Erlang, A. K. (1909). The theory of probabilities and telephone conversations. Nyt Tidsskrift for Matematik, 20(B), 33–39. link ↗
- Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their application to the theory of failures. Annals of Mathematical Statistics, 24(3), 338–354. link ↗
- Gross, D., Shortle, J. F., Thompson, J. M., & Harris, C. M. (2008). Fundamentals of Queuing Theory (4th ed.). John Wiley & Sons. link ↗
How to cite this page
ScholarGate. (2026, June 3). Queuing Theory for Healthcare Service Management and Wait Time Analysis. ScholarGate. https://scholargate.app/en/healthcare-management/queuing-theory-healthcare
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- DEA Hospital EfficiencyHealthcare Management↔ compare
- Hospital Bed Occupancy ModelHealthcare Management↔ compare
- Lean HealthcareHealthcare Management↔ compare
- Patient Flow SimulationHealthcare Management↔ compare
- Staffing Ratio AnalysisHealthcare Management↔ compare