Productivity, checked · Part 3 of 8
Flow: the arithmetic of the pile
Picture a supermarket on a Saturday afternoon. Every till is staffed, every cashier is scanning as fast as they can, and the queues still reach back into the frozen aisle. Nobody is lazy. The shop is simply running at full capacity, and a shop at full capacity is a shop where customers wait.
Most knowledge workers run their week like that supermarket. Every hour is booked, a dozen projects are "in progress", and the important thing still takes a month. The usual diagnosis is effort or discipline. The usual cure is a better to-do app.
This part is about a different diagnosis. Work behaves like a queue, and queues follow rules that have nothing to do with willpower. Several of the rules are mathematics, which makes this the rare part of the productivity literature where the books are mostly right. The question for this station is plain: does work move, or does it pile up?
Little's law: why more in progress means slower
In 1961 John Little proved a result so general it barely sounds like a finding. Average work in progress equals the arrival rate times the average time each item spends in the system. Rearranged: the time an item takes to get through equals the amount of work in progress divided by throughput. It holds for any system, over any period that starts and ends empty, however the work arrives (Little 1961; Little 2011).
The consequence is uncomfortable. If you finish about two projects a month and have twelve open, the average project will take six months, however hard you work on each one. Starting a thirteenth doesn't add output. It adds waiting.
The Phoenix Project turns this into its central lesson: limit work in progress, because releasing more work into a busy system makes everything slower. Cal Newport's Slow Productivity makes the personal version: "do fewer things", keep a holding queue, and pull new work in only when something finishes (~85%). He adds an observation that matches everyday experience: every commitment carries an overhead tax of emails, check-ins and meetings, so the number of commitments matters more than their size. The switching-cost mechanism behind that is supported; his tipping-point picture is a model.
There is one honest caveat. Little's law is an identity of averages. Cutting work in progress shortens lead time only if throughput doesn't fall with it. Close half your projects and spend the freed time refreshing your inbox, and nothing improves.
The field evidence for the practical tools is thinner than the maths. Reviews of kanban boards and WIP limits in software teams find the literature "largely descriptive", with the best-supported benefits being visibility and flow; one four-year case study of five teams found that lower WIP went with shorter lead times, but nobody knows the optimal limit.
Small batches follow the same logic. A big batch is a lot of work in progress travelling together, and nothing in it is finished until all of it is. In one production-line simulation, cutting batch sizes reduced lead time by around 30%, though extra setups can eat the gain. In software, the State of DevOps surveys found that teams deploying often, in small pieces, also had fewer failed changes. The direction has held across years; the dramatic multipliers ("46× more deployments") depend on how the survey answers were bucketed, so treat them as decoration (direction ~70%, multipliers ~30%). (The metrics themselves: see Feedback.)
Slack: why full is broken
Back to the supermarket. Queueing theory explains why the queue grows so suddenly in the last stretch before full capacity. In the simplest queue, waiting time scales with utilisation divided by idle time. At 50% busy, that ratio is 1. At 90% busy, it is 9: work waits nine times as long (~85%). Push towards 100% and the wait heads off towards infinity.
The exact factor depends on how variable the arrivals and the tasks are. Real queues are usually more variable than the textbook one, which makes the blow-up worse, not better. Anyone who has watched a motorway at rush hour has seen this: the road isn't full, but it is full enough that one braking driver turns into a standstill.
Accelerate lists utilisation alongside lines of code as a misleading measure, because pushing it towards 100% makes queues and lead times explode. The lesson for an individual is counter-intuitive and well grounded: a calendar with no gaps is not efficient. It is a queue with nowhere for the surprises to go.
Bottlenecks: the slowest hiker sets the pace
Eliyahu Goldratt's The Goal, a 1984 business novel about a failing factory, puts the next idea in a scout troop. Herbie is the slowest boy on the hike, and however fast the others walk, the troop arrives when Herbie does. A serial system's throughput is set by its bottleneck (~95%).
Two corollaries follow, and both hold up. An hour lost at the bottleneck is an hour lost for the whole system, while an hour saved elsewhere is, for throughput at least, a mirage (savings elsewhere can still cut inventory or lead time). And keeping every worker busy is a mistake: anything produced faster than the bottleneck can absorb just becomes a pile in front of it (~85%). Local efficiency is not global productivity.
Andy Grove reached the same conclusion at Intel around the same time. His High Output Management opens with a breakfast factory and tells the reader to find the limiting step (the boiled egg) and schedule backwards from it. Goldratt's remedy is five steps: identify the constraint, exploit it, subordinate everything else to it, elevate it, and repeat when it moves. Over 80 published applications report gains in lead time and due-date performance, but they are success stories with no controls and no reported failures.
The Phoenix Project adds the bottleneck most knowledge workers will recognise: Brent, the one engineer behind almost every task, constantly interrupted and indispensable. Knowledge concentration is common. One study estimated that 65% of 133 popular GitHub projects would be in trouble if two or fewer people left. That Brent is the constraint, and that documenting his knowledge fixes it, is story. The personal version is sharper: if everything waits on you, you are your own Brent.
The same book sorts work into four types: business projects, internal projects, changes, and unplanned work. Unplanned work, the firefighting, is the dangerous one, because time is zero-sum and every emergency silently displaces something planned. Benchmark data from IT organisations suggest high performers spend under 5% of their time on it and low performers often over half (~70%; the original report isn't public). For one person, the question is the same: how much of last week was on the plan at all?
The order of work
Once work is limited and the bottleneck found, a smaller question remains: in what order? Brian Christian and Tom Griffiths's Algorithms to Live By brings in scheduling theory, and its main result is a relief. There is no best schedule, only a best schedule for a goal (~95%). Doing tasks in order of due date minimises how late the latest one is. Doing the shortest first minimises the total time things spend waiting. Moore's algorithm minimises the number of late tasks. Pick the goal before you pick the method.
Their most memorable story is priority inversion. On the Mars Pathfinder in 1997, a low-priority task held a shared resource that a high-priority task needed, and the important work stalled behind the trivial. Engineers fixed it remotely by switching on priority inheritance, which lets the blocking task borrow the high priority until it lets go. The office version is the unimportant form that blocks the important project. Sometimes the right move is to finish the trivial thing first, because something big is waiting on it.
The authors also warn about thrashing, switching so often that all time goes to switching; the cost of that belongs to Attention. And the transfer from algorithm to life is weaker than the theorems: real life rarely offers one goal, known options and no going back.
Estimates: the inside view is always sunny
All of this assumes you know how big the work is. You don't. In a 1994 study, Roger Buehler and colleagues asked 37 honours students when they would finish their thesis. They predicted 33.9 days on average and took 55.5. Only 29.7% finished by their own best guess. More striking, their worst-case estimates (48.6 days) were still too short on average, though not significantly, and fewer than half (48.7%) finished even by those (Buehler et al. 1994). These were important, familiar projects, nearly done, by people with every reason to get it right. The planning fallacy is one of the sturdiest findings in psychology.
Asking people to be pessimistic reduced the bias in that study but didn't make the estimates more accurate. The problem isn't mood. It is method. We plan from the inside, imagining how this project will go, and the imagination leaves out the flu, the missing data and the supervisor on holiday.
Daniel Kahneman's fix in Thinking, Fast and Slow is the outside view: start from how long similar projects actually took, then adjust for what's special about this one. Bent Flyvbjerg's reference class forecasting, used in British and Danish infrastructure planning, rests on the same idea; the field evidence is good, the controlled trials few ~70 %. Newport's simpler rule is to double your estimates. The direction is right; the factor of two is a rule of thumb.
Frederick Brooks, writing about software in The Mythical Man-Month, adds a useful mechanism: a project gets a year late one day at a time, and fuzzy milestones hide the slippage. Milestones should be concrete enough that "done" means done, not "90% done".
More people: the coordination tax
When a project is late, the obvious move is to add people. Brooks's law says this makes it later (The Mythical Man-Month, 1975). The reasoning has two parts. Newcomers need training. And communication paths grow as n(n−1)/2: three people have three, ten people have 45 (~95%). That is an upper bound, since real teams don't use every channel, which is why structure helps.
The law itself has aged less well. Brooks later called his wording an "outrageous oversimplification". Steve McConnell argued in 1999 that it applies mainly in a project's final phases, that adding people mostly raises cost rather than always causing delay, and that most lateness comes from underestimating the project in the first place (~50% for "always later"). Coordination cost is real; the iron law is not. As Brooks put it himself, nine women can't make a baby in one month, but not every task is a pregnancy.
Conway's law describes where coordination ends up. A system's structure tends to mirror the communication structure of the organisation that builds it. In matched pairs of software products, the product built by the more loosely coupled organisation was more modular every time, by up to a factor of eight (MacCormack, Rusnak & Baldwin 2012) (~85%). A review of 142 studies found mirroring common in companies but often absent in open-source projects. The popular remedy, reorganising teams first and letting the architecture follow, is untested.
The personal lesson is about dependencies. Every task that waits for someone else's reply has a queue in it you don't control. Fewer of those is worth more than faster typing.
What doesn't work
- "Adding people to a late project always makes it later." Coordination costs are real, but McConnell and project data show the effect is mainly cost, and mainly late in a project (~50%).
- Worst-case estimates as a safety margin. In Buehler's study fewer than half of students finished by their own worst-case date ~95 %.
- "Balanced plants go broke." Spare capacity away from the bottleneck is well supported, but simulations of deliberately unbalanced lines show mixed, modest gains; the slogan overstates (~70% for "keep spare capacity off the bottleneck").
- Change approval boards as the cure for outages. The diagnosis (changes cause most outages) holds; the Accelerate data found external approvals went with slower delivery and no fewer failures (~30% for the cure).
- Drum-buffer-rope as the best scheduling method. Simulation results are mixed and depend on setup and tuning (~50%).
Try this
- Set a WIP limit and keep a holding queue. Count your active projects, pick a number you can actually move each week, and start something new only when something finishes.
- Leave gaps in your calendar on purpose. Treat unbooked time as the buffer that keeps surprises from turning into a queue.
- Find your Herbie. Ask where work waits longest (your review, your decisions, someone's sign-off) and protect that step before speeding up anything else.
- Estimate from your own history. Before committing to a date, look up how long the last three similar projects took, then adjust.
- Cut dependencies. Prefer tasks you can finish without waiting for someone else, and batch the ones you can't.
3 claims checked
The evidence behind this article
Every claim above, rated by the chance it holds up against the research. Open one for the sources and their exact words.
- Brooks (1975). The Mythical Man-Month · Book
- Buehler, Griffin, Ross (1994). Exploring the "planning fallacy": Why people underestimate their task completion times. · Study
- Christian, Griffiths (2016). Algorithms to Live By · Book
- Flyvbjerg (2007). Curbing Optimism Bias and Strategic Misrepresentation in Planning: Reference Class Forecasting in Practice · Study
- Forsgren, Humble, Kim (2018). Accelerate · Book
- Goldratt, Cox (1984). The Goal · Book
- Grove (1983). High Output Management · Book
- Kahneman (2011). Thinking, Fast and Slow · Book
- Kim, Behr, Spafford (2013). The Phoenix Project · Book
- Little (1961). A Proof for the Queuing Formula: L = λW · Source
- Little (2011). OR FORUM—Little's Law as Viewed on Its 50th Anniversary · Source
- MacCormack, Rusnak, Baldwin (2012). Exploring the duality between product and organizational architectures: A test of the "mirroring" hypothesis · Study
- McConnell (1999). Brooks' Law Repealed? · Source
- Newport (2024). Slow Productivity · Book