🧪 M/M/c Queue Simulator

Business process automation lives or dies on queueing math: how many parallel automation workers does a job stream actually need? This simulator runs a real M/M/c discrete-event simulation — jobs arrive via a genuine Poisson process, are routed to the first free server among c parallel servers, and each server's service time is drawn from a real exponential distribution. Every job's arrival, service-start and departure timestamps are tracked so the displayed average wait, queue length and utilization are measured outcomes of the simulation, not a formula plugged into a placeholder. Alongside the empirical numbers, the panel shows the closed-form Erlang-C prediction for the same λ, μ, c so you can watch the simulated averages converge toward theory as the run gets longer — and watch the queue genuinely spiral when ρ = λ/(cμ) crosses 1.