What does Bottleneck Triage and Value-per-Hour Scheduling conclude, in numbers, about “No Stalls: Log-Normal Tails, Pooled Buffers and a Focus Budget That Includes Rest”?
Answer: The first row is the most favourable case: no systematic bias and little spread, with s at 0.3. Even so, a day without a buffer runs over with probability 0.590. A buffer of 0.15 brings this down to 0.231, a buffer of 0.30 to 0.058, and a buffer of half the plan to 0.006. The second row widens the spread to 0.6. Without a buffer the probability of running over is 0.669; with a buffer of 0.30 it is still 0.326, and with half the plan as buffer it is 0.177.
Scope of the numbers: Smith proved in 1956 that when one person faces a list, the order that minimises the weighted cost of delay sorts tasks by value divided by duration, not by value; on seven illustrative tasks the importance order pays 0.311 more than the exhaustive optimum. Frustum culling and levels of detail from computer graphics show that a fixed frame budget should not be spent on doing everything finely: doing all eight illustrative tasks finely finishes only three and reaches 0.783 of the best plan.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.006, 0.058, 0.15, 0.177, 0.231, 0.3
| reference optimism ratio 55.5 / 33.9 = 1.637 | |||||
| b | s | P(late) at buffer 0 | 0.15 | 0.30 | 0.50 |
| 1.000 | 0.3 | 0.590 | 0.231 | 0.058 | 0.006 |
| 1.000 | 0.6 | 0.669 | 0.484 | 0.326 | 0.177 |
| 1.200 | 0.6 | 0.861 | 0.721 | 0.565 | 0.375 |
| 1.637 | 0.6 | 0.986 | 0.955 | 0.895 | 0.771 |
| mean / median of one task at s = 0.6: 1.197 |
Show the full program
# Chapter 6. p61: log-normal task times and the chance a day overruns.
# A focus plan of six tasks estimated at 100, 70, 50, 40, 30, 10 minutes
# (300 in all). Actual minutes = estimate * b * exp(N(0, s^2)): b is a
# systematic optimism factor, s the spread. The reference ratio for b
# is Buehler, Griffin and Ross (1994): thesis students predicted 33.9
# days on average and took 55.5. A buffer of x adds x * 300 minutes.
# 50,000 simulated days per row; illustrative estimates.
import math
import random
EST = [100, 70, 50, 40, 30, 10]
PLAN = math.fsum(EST)
ratio = 55.5 / 33.9
print("reference optimism ratio 55.5 / 33.9 = %.3f" % ratio)
def overrun(b, s, buf, days=50000):
rng = random.Random(37661)
late = 0
for _ in range(days):
t = math.fsum(e * b * math.exp(rng.gauss(0.0, s)) for e in EST)
if t > PLAN * (1.0 + buf):
late += 1
return late / days
print("b s P(late) at buffer 0 0.15 0.30 0.50")
for b, s in ((1.0, 0.3), (1.0, 0.6), (1.2, 0.6), (ratio, 0.6)):
row = [overrun(b, s, x) for x in (0.0, 0.15, 0.30, 0.50)]
print("%.3f %.1f %18.3f %6.3f %6.3f %6.3f" % ((b, s) + tuple(row)))
mean_factor = math.exp(0.6 * 0.6 / 2.0)
print("mean / median of one task at s = 0.6: %.3f" % mean_factor)Single source and citation
Fan, Y. (2026). Stage-Bottleneck Triage, Weighted Shortest-Processing-Time Scheduling and Level-of-Detail Execution Velocity (Version 1.0.0), Chapter 6: No Stalls: Log-Normal Tails, Pooled Buffers and a Focus Budget That Includes Rest. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-376 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026376,
author = {Fan, Yafu},
title = {Stage-Bottleneck Triage, Weighted Shortest-Processing-Time Scheduling and Level-of-Detail Execution Velocity},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Why "Most Important First" Is Wrong: Value per Hour and the Adjacent Interchange
- Chapter 2 · Streams of Arriving Work: the c-mu Rule, the Generalised c-mu Rule and the Gittins Index
- Chapter 3 · The Single Bottleneck of a Phase: a Five-Stage Funnel, Little's Law and the Moving Constraint
- Chapter 4 · Frustum Culling: Tasks with No Causal Path to Cash
- Chapter 5 · Levels of Detail: a Multiple-Choice Knapsack inside a Fixed Focus Budget
- Chapter 7 · The Classical Sources: Sunzi on Emptiness and Fullness, Mencius on Declining, Seneca's Second Letter and the Law of the Minimum
- Chapter 8 · Field Tools and Checker Specifications: the Daily Scheduling Ledger, the Scheduler and a Pre-registered Test