What does Bottleneck Triage and Value-per-Hour Scheduling conclude, in numbers, about “Why "Most Important First" Is Wrong: Value per Hour and the Adjacent Interchange”?
Answer: With k equal to zero or 0.3 the ratio order barely changes. Its expected cost is about 292.8 points, roughly 0.318 below the importance order. With k equal to 0.6 the planned duration of the shelving task shrinks from 180 minutes to 93 minutes, and the task jumps to second place in the ratio order. The expected cost rises to 316.3 points, 0.080 more than ordering by the true ratios. Even so, the biased ratio order still beats the importance order, by 0.220.
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.080, 0.220, 0.3, 0.318, 0.6, 292.8
| k | order by w/plan | E cost | order by w | E cost | gap |
|---|---|---|---|---|---|
| 0.0 | CAEBDFG | 292.8 | BCGDEAF | 385.8 | 0.318 |
| 0.3 | CAEBDGF | 292.7 | BCGDEAF | 385.8 | 0.318 |
| 0.6 | CBEADGF | 316.3 | BCGDEAF | 385.8 | 0.220 |
| cost of the k = 0.6 bias against true WSEPT: 0.080 | |||||
| planned minutes at k = 0.6: 39 93 45 71 51 60 79 |
Show the full program
# Chapter 1. p13: uncertain durations (WSEPT) and biased estimates.
# Actual minutes are log-normal with the planned mean (sigma = 0.6).
# Rothkopf (1966): ordering by w / E[p] minimises expected sum w C.
# Bias: the operator underestimates large tasks more, planned = true *
# (true / 60) ** (-k); k = 0 is unbiased. The ranking then uses the
# biased plan while costs accrue on true durations. Days and weights are
# the seven illustrative tasks of p11. 20,000 simulated days per row.
import math
import random
import statistics
TASKS = [(20, 6.0), (180, 20.0), (30, 15.0), (90, 9.0), (40, 8.0),
(60, 5.0), (120, 10.0)]
SIG = 0.6
def simulate(order, rng, days=20000):
mu_shift = -SIG * SIG / 2.0
out = []
for _ in range(days):
t, terms = 0.0, []
for i in order:
t += TASKS[i][0] * math.exp(rng.gauss(mu_shift, SIG))
terms.append(TASKS[i][1] * t / 60.0)
out.append(math.fsum(terms))
return statistics.fmean(out)
def plan(k):
return [p * (p / 60.0) ** (-k) for p, _ in TASKS]
idx = range(len(TASKS))
by_w = sorted(idx, key=lambda i: (-TASKS[i][1], i))
print("k order by w/plan E cost order by w E cost gap")
for k in (0.0, 0.3, 0.6):
pl = plan(k)
o = sorted(idx, key=lambda i: (-TASKS[i][1] / pl[i], i))
c1 = simulate(o, random.Random(37613))
c2 = simulate(by_w, random.Random(37613))
lab = "".join("ABCDEFG"[i] for i in o)
print("%.1f %-16s %7.1f %-10s %7.1f %.3f" % (
k, lab, c1, "BCGDEAF", c2, c2 / c1 - 1.0))
true_o = sorted(idx, key=lambda i: (-TASKS[i][1] / TASKS[i][0], i))
c0 = simulate(true_o, random.Random(37613))
o6 = sorted(idx, key=lambda i: (-TASKS[i][1] / plan(0.6)[i], i))
c6 = simulate(o6, random.Random(37613))
print("cost of the k = 0.6 bias against true WSEPT: %.3f" % (c6 / c0 - 1))
print("planned minutes at k = 0.6: " +
" ".join("%d" % round(x) for x in plan(0.6)))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 1: Why "Most Important First" Is Wrong: Value per Hour and the Adjacent Interchange. 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 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 6 · No Stalls: Log-Normal Tails, Pooled Buffers and a Focus Budget That Includes Rest
- 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