Stage-Bottleneck Triage, Weighted Shortest-Processing-Time Scheduling and Level-of-Detail Execution Velocity: chapter answers
Three sayings dominate advice on planning a day: do the most important thing first, do every task to the highest standard, and run several lines at once because parallel is faster. This book turns each into a computable claim and tests it. 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…
DOI pending · monograph page goes live after publication · 5DL-B-376 · 中文版
- Chapter 1 · Why "Most Important First" Is Wrong: Value per Hour and the Adjacent Interchange
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 1… - Chapter 2 · Streams of Arriving Work: the c-mu Rule, the Generalised c-mu Rule and the Gittins Index
Read the results at three loads. At a load of 0.70, the fixed rule that always gives questions priority costs 2.560 points per task on average and the generalised rule costs 2.769, so the fixed rule is cheaper. At 0.85… - Chapter 3 · The Single Bottleneck of a Phase: a Five-Stage Funnel, Little's Law and the Moving Constraint
All four cases show the same weekly output, 14.03 orders, because that is how many come in and every case can cope with them. The differences lie in flow time and work in progress. In the baseline, an order spends on av… - Chapter 4 · Frustum Culling: Tasks with No Causal Path to Cash
With no misreading at all, culling raises the day's value from 110.7 points to 219.1, an increase of 0.979, nearly double. With a misreading rate of 0.1 the increase is 0.846; at 0.3 it is still 0.548; even at 0.5, when… - Chapter 5 · Levels of Detail: a Multiple-Choice Knapsack inside a Fixed Focus Budget
Doing everything finely is the most revealing case. Only three of the eight tasks get done, for a total value of 101, which is 0.783 of the optimal plan. Doing everything coarsely finishes all eight tasks but reaches a… - Chapter 6 · No Stalls: Log-Normal Tails, Pooled Buffers and a Focus Budget That Includes Rest
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… - Chapter 7 · The Classical Sources: Sunzi on Emptiness and Fullness, Mencius on Declining, Seneca's Second Letter and the Law of the Minimum
In the demand-bound week, demand is 12.00 orders, capacity is spare and orders are 12.00. Raising visitors, the first yield or the second yield lifts orders to 13.20 in each case, an elasticity of 1.00; the elasticities… - Chapter 8 · Field Tools and Checker Specifications: the Daily Scheduling Ledger, the Scheduler and a Pre-registered Test
Chapter 8 gives field tools and checker specifications: the daily scheduling ledger, the distilled Bottleneck Focus and Value-per-Hour Scheduler, red, yellow and green checks, daily, weekly and monthly rhythms, and a pr…
Illustrative model calculation, not a live quote