Little’s Law Capacity
Relate stable throughput, time in system and work in progress.
Your numbers
Average concurrent work
Requires stable long-run averages and consistent system boundaries. This is not a maximum concurrency or queueing-tail guarantee.
Scenario comparison
Up to three snapshots in this tab. Loading one replaces the current inputs.
Formula
L=λW
Relate stable throughput, time in system and work in progress.
Worked example
- Average arrivals per second
- 100
- Average time in system (seconds)
- 0.2
- Average concurrent work
- 20
Scope and limitations
Requires stable long-run averages and consistent system boundaries. This is not a maximum concurrency or queueing-tail guarantee.
Inputs are checked for missing values and allowed ranges. A result outside the finite numeric range is not displayed. Rounding affects display, while the calculation uses the model’s numeric precision.
Check your units and assumptions before relying on a result. Changing a label does not convert a currency or physical unit.
Formula version: 8d0c6ed7f2d8 · Example checked: