What does Bottleneck Triage and Value-per-Hour Scheduling conclude, in numbers, about “The Single Bottleneck of a Phase: a Five-Stage Funnel, Little's Law and the Moving Constraint”?
Answer: 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 average 1.402 weeks in the chain, there are 19.63 orders in progress, and 12.79 of them are waiting in front of engagement. Speeding acquisition up by half cuts the flow time to 1.302 weeks, while the queue in front of engagement is 12.84 orders. Speeding delivery up by half cuts the flow time to 1.224 weeks, with 12.79 orders still waiting in front of engagement. Only when engagement is sped up by a fifth does the flow time fall to 0.673 weeks and work in progress to 9.42 orders, with just 2.75 waiting in front of engagement.
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.673, 1.224, 1.302, 1.402, 12.79, 12.84
| case | thru/wk | flow wks | WIP | WIP before engage |
|---|---|---|---|---|
| baseline | 14.03 | 1.402 | 19.63 | 12.79 |
| acquire +50 % | 14.03 | 1.302 | 18.23 | 12.84 |
| deliver +50 % | 14.03 | 1.224 | 17.13 | 12.79 |
| engage +20 % | 14.03 | 0.673 | 9.42 | 2.75 |
| 52 weeks, work pushed in at stage-1 speed | ||||
| baseline passed acquire 1,054 passed engage 757 stuck 297 | ||||
| acquire +50 % passed acquire 1,596 passed engage 757 stuck 839 | ||||
Show the full program
# Chapter 3. p32: speeding a non-bottleneck stage, simulated.
# A three-stage line (acquire -> engage -> deliver) with exponential
# work at rates 20, 15, 18 orders per week; orders released as a Poisson
# stream of 14 per week. Infinite buffers, first come first served:
# D_s,k = max(D_s-1,k, D_s,k-1) + S_s,k.
# Little's law (L = lam W) turns the mean flow time into mean WIP.
# Second block: work pushed in as fast as stage 1 can take it for 52
# weeks, showing where unfinished work piles up. Illustrative rates.
import math
import random
def line(rates, lam, n):
rng = random.Random(37632)
t, prev = 0.0, [0.0] * len(rates)
flow, wait2, last = [], [], 0.0
for _ in range(n):
t += rng.expovariate(lam)
d = t
for s, r in enumerate(rates):
start = max(d, prev[s])
if s == 1:
wait2.append(start - d)
d = start + rng.expovariate(r)
prev[s] = d
flow.append(d - t)
last = d
w = math.fsum(flow) / n
return n / last, w, lam * w, lam * math.fsum(wait2) / n
print("case thru/wk flow wks WIP WIP before engage")
cases = [("baseline", [20, 15, 18]), ("acquire +50 %", [30, 15, 18]),
("deliver +50 %", [20, 15, 27]), ("engage +20 %", [20, 18, 18])]
for name, r in cases:
th, w, L, q2 = line(r, 14.0, 200000)
print("%-17s %7.2f %8.3f %5.2f %6.2f" % (name, th, w, L, q2))
def pushed(rates, weeks):
rng = random.Random(37633)
prev = [0.0] * len(rates)
done1 = done2 = 0
t1 = 0.0
while True:
t1 += rng.expovariate(rates[0])
if t1 > weeks:
break
done1 += 1
start = max(t1, prev[1])
prev[1] = start + rng.expovariate(rates[1])
if prev[1] <= weeks:
done2 += 1
return done1, done2
print("52 weeks, work pushed in at stage-1 speed")
for name, r in cases[:2]:
a, b = pushed(r, 52.0)
print("{:<17} passed acquire {:>5,} passed engage {:>5,} "
"stuck {:>4,}".format(name, a, b, a - b))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 3: The Single Bottleneck of a Phase: a Five-Stage Funnel, Little's Law and the Moving Constraint. 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 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