🏦 Bank Hall Queueing Theory: M/M/c Erlang C Wait versus Utilisation
Customers arrive at random at a bank hall with a rope maze and up to six teller windows. A discrete-event simulation drives the animated people while the page compares the measured wait with the Erlang C formula, Little's law and the Pollaczek-Khinchine result, and measures how much worse separate lines are than one shared line.
Customers arrive at random at a bank hall with a rope maze and up to six teller windows. A discrete-event simulation drives the animated people while the page compares the measured wait with the Erlang C formula, Little's law and the Pollaczek-Khinchine result, and measures how much worse separate lines are than one shared line.
3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install