Heuristic

Treat a growing backlog as a warning, not a delay forecast

More unfinished work deserves attention. It does not make today’s backlog divided by today’s completions an exact prediction of waiting time.

About 2 min read

Before you use it

Use when
  • When more work is being started than finished and people respond by opening even more tasks.

Keep this limit in mind

  • Queueing equations have specific assumptions. Use them for directional reasoning and measurement design, not as exact forecasts for arbitrary multi-stage knowledge work.

Current editorial reading

Count what enters and leaves

Choose one process boundary and count comparable work items. Record starts, completions and other exits, such as cancellations, separately. If six requests enter and four finish each week, with no other exits, two more remain unfinished each week. That establishes accumulation. Check the age of unfinished requests as well as the elapsed time of completed ones before concluding who is waiting longer.

Keep the average relation in scope

Little’s Law connects average work in the system, arrival rate and time spent there under stated mathematical conditions. The original proof requires finite averages and stationary processes. A persistently growing backlog does not itself meet that stable-average picture. Use the relation to compare appropriately measured averages; do not turn a changing snapshot into a precise forecast or a claim that every request slows down.

Take it with you

Investigate sustained accumulation rather than celebrating starts. Compare incoming work, exits and aging on the same boundary. Then test an intervention against completion and delay; the equation does not choose the intervention.

Sources and evidence (1)

What we checked

Supports

Little’s original theorem relates the three means under finiteness, strict stationarity and a metrically transitive arrival process with nonzero mean.

Abstract-only appraisal; the proof and later extensions were not reviewed.

A Proof for the Queuing Formula: L = λW · Abstract, Operations Research 9(3), 1961, pp. 383–387

Limits

The cited stationary-mean theorem alone does not establish an instantaneous waiting-time forecast for a persistently growing backlog.

This is the editorial applicability limit inferred from the stated assumptions. The example uses only inventory accounting; age tracking is an editorial diagnostic recommendation.

A Proof for the Queuing Formula: L = λW · Abstract: conditions attached to L = λW

Editorial sources (1)

Editorial version 1.0.0 · Evidence checked 2026-10-04

Save and practise this idea

My learning

Read. Recall. Repeat.

Save this idea and return to it on any device.

Use email
Keep exploring

Connected ideas

You are readingTreat a growing backlog as a warning, not a delay forecast

Original edition evidence and sources

These records belong to the original released edition. The current editorial reading has its own evidence above; neither set silently replaces the other.

Supports

Little's Law relates long-run average work in a stable system to arrival/throughput rate and average time in system as L = λW under stated mathematical conditions.

The relation does not identify root cause, queue discipline or the correct intervention; workplace applications must respect the assumptions.

A Proof for the Queuing Formula: L = λW · Abstract

All sources (1)
Original edition, downloads and provenance

The reading above is editorial version 1.0.0, bound to this exact source edition. The original data and saved downloads retain that edition and the separate editorial layer. They may contain earlier wording; use the current reading above when interpreting it.

Version 0.1.0

No review details are supplied for this edition.

Read the original edition and overlay as JSON · Release details