Canadian University DubaiSchool of Managementcud.ac.ae ↗
EXPLORE ANALYTICS / CASE 03

One more person.
How much less waiting?

Explore an M/M/c queue: random arrivals, exponential service times and identical parallel servers. Change the assumptions and watch the trade-off.

Illustrative queueing model

Compare staffing levels under the same demand and service assumptions
StaffUtilizationExpected waitCapacity / hour
Model and limitations

The Erlang C formula estimates the probability of waiting and the mean queue wait. A steady state exists only when arrivals are below total service capacity. The model assumes stationary independent Poisson arrivals, exponential service times, a single first-come-first-served queue, no abandonment and unlimited waiting space. Real queues can violate these assumptions; these results are illustrative, not staffing advice for a specific operation.