Calculate required consumers and concurrency with Little’s law and Erlang C to estimate utilization, wait probability, and backlog drain time for queue workloads.
MIT
Queueing simulation: M/M/c, staffing, Erlang C checks, and multi-step models built from nodes.
Exact staffing math: FTE needed, a monthly hiring plan, and Erlang C queue staffing.