Home▸Operations Research▸Single-Server Queue: Arrivals, Service Variability and the Pollaczek-Khinchine Wait

Single-Server Queue: Arrivals, Service Variability and the Pollaczek-Khinchine Wait

Top-down lane of customers served by one counter, with utilisation gauges, the share of time with n customers in the system against the geometric law, and the wait-versus-load curve for the chosen service-time variability. Same shared model and numerical checks as the 3D cafe.

Operations Research2DModerate60 FPS📱 Mobile-adapted🟠 Blender⇄ 3D version
Single-Server Queue: Arrivals, Service Variability and the Pollaczek-Khinchine Wait ↗ Open standalone

One barista, a line of customers and a Poisson stream of arrivals: watch the queue build, drain and explode as utilisation rho approaches 1. Choose exponential, constant, Erlang-4 or very bursty service times and compare the measured wait with the Pollaczek-Khinchine formula, the M/M/1 geometric law and Little's law L = lambda W, all checked in the page against long independent event-driven runs. Customers walk in and out of the line in 3D.

⚙ Under the hood

Top-down lane of customers served by one counter, with utilisation gauges, the share of time with n customers in the system against the geometric law, and the wait-versus-load curve for the chosen service-time variability. Same shared model and numerical checks as the 3D cafe.

Queueing TheoryM/M/1Little's LawPollaczek-KhinchineOperations ResearchStochastic Simulation

2D · HTML5 Canvas 2D · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)