Home▸Operations Research▸Single-Server Queue: Utilisation, Waiting Time and Little's Law at a Cafe Counter

Single-Server Queue: Utilisation, Waiting Time and Little's Law at a Cafe Counter

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.

Operations Research3DModerate60 FPS📱 Mobile-adapted🟠 Blender🤖 ChatGPT⇄ 2D version
Single-Server Queue: Utilisation, Waiting Time and Little's Law at a Cafe Counter ↗ 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

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.

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

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install

What did you find?

Add reproduction steps (optional)