The Mathematics of Waiting
Queueing theory, born from Agner Krarup Erlang's work on telephone exchanges in 1909, is the mathematical study of waiting lines. The M/M/1 queue — one server, random arrivals, random service times — is the foundational model. Despite its simplicity, it reveals a profound insight: even when average service is faster than average demand, randomness creates waiting. The ratio of arrival rate to service rate (utilization, ρ) determines whether the queue is manageable or catastrophic.
The Utilization Trap
The most counterintuitive result in queueing theory is the nonlinear relationship between utilization and wait time. At 50 % utilization, average queue length is just 0.5 customers. At 80 %, it rises to 3.2. At 90 %, it jumps to 8.1. At 95 %, it reaches 18. And at 99 %, the average queue is 98 customers long. This explosive growth near capacity explains why hospitals, airports, and highways experience sudden congestion when demand increases by seemingly small amounts.
Little's Law: The Universal Queue Truth
In 1961, John Little proved an elegantly simple result: the average number of items in a system (L) equals the arrival rate (λ) times the average time each item spends in the system (W). Remarkably, L = λW holds for any stable queue, regardless of the arrival distribution, service distribution, or number of servers. It is the E = mc² of operations research — a compact equation with sweeping implications for system design and capacity planning.
Applications in Transportation
Every transportation system contains queues: vehicles at traffic signals, passengers at boarding gates, ships waiting for berths, parcels in sorting facilities. Queueing models help engineers determine how many toll booths, security lanes, or boarding gates to operate. The key design principle is maintaining utilization well below 100 % — typically targeting 70–80 % — to keep wait times reasonable while avoiding the enormous cost of idle capacity.