# Little’s Law

> A queueing formula: average time in a system equals average number of items in it divided by average throughput.

Source: https://cbse.club/glossary/littles-law · Updated 2026-11-03

Little’s Law comes from queueing theory, proven by John Little in 1961. In kanban terms: **average cycle time = average work in progress ÷ average throughput**.

### Worked example

A team finishes 5 cards a week and has 15 in progress. Average cycle time ≈ 15 ÷ 5 = 3 weeks. Halve WIP to 7–8 with the same throughput, and cycle time drops to about 1.5 weeks.

### Caveats

It describes long-run averages in a reasonably stable system. It does not predict any single card, and it assumes work that enters eventually leaves. Still, its lesson is robust: less in progress means faster delivery.
