What does Three-City Teams: Handoffs and Acceptance conclude, in numbers, about “Acceptance Sampling: Operating Characteristics, the kp Rule and the Boundaries of All or None”?
Answer: Chapters 4 and 5 show that for a stable process the kp rule admits only full or no inspection, and that an interior optimum comes only from the value of information when defect rates are unstable: sampling 15 items before deciding saves 38.3 hours per lot; the sample worth paying for is 42 items, and under drift one samples every 2.32 working days.
Scope of the numbers: Its schedules, lunch breaks, cost coefficients, exchange-rate volatilities and price levels are illustrative, and all calculations are generated by its programs. It is general management guidance, not individual, legal or tax advice; labour, tax and work-pass matters in the three cities must be confirmed by licensed local advisers.
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: 15, 38.3
| stable p f | 0 f=0.25 f=0.5 f=1 best |
| 0.01 | 25.0 43.8 62.5 100.0 none |
| 0.03 | 75.0 81.2 87.5 100.0 none |
| 0.04 | 100.0 100.0 100.0 100.0 tie |
| 0.05 | 125.0 118.8 112.5 100.0 all |
| 0.10 | 250.0 212.5 175.0 100.0 all |
| unstable mix: none 95.0 h, all 100.0 h per lot | |
| sample n | 5 then decide: 68.2 h |
| sample n | 10 then decide: 58.7 h |
| sample n | 15 then decide: 56.7 h |
| sample n | 40 then decide: 68.0 h |
| sample n | 80 then decide: 83.9 h |
| best n | 15 saves 38.3 h per lot against the better boundary |
| perfect knowledge of p per lot would cost 40.0 h |
Show the full program
# Chapter 4. p42: Deming's kp rule, and where partial sampling earns its keep.
# k1 = 0.5 h to inspect one deliverable, k2 = 12.5 h of downstream rework
# when a defective one escapes (illustrative), so k1 / k2 = 0.04. A lot
# has N = 200 items. Inspecting a random fraction f of a lot whose
# defect rate p is stable costs N * (f * k1 + (1 - f) * p * k2): linear
# in f, so the optimum is f = 0 or f = 1 (the all-or-none rule).
# Part two: lots come from a process that is not stable, p = 0.01 with
# probability 0.8 and p = 0.15 with probability 0.2 (mean 0.038). Plan
# "sample n, inspect the rest if any defect is found" is then compared.
import math
K1, K2, N = 0.5, 12.5, 200
def lot_cost(p, f):
return N * (f * K1 + (1 - f) * p * K2)
print("stable p f=0 f=0.25 f=0.5 f=1 best")
for p in (0.01, 0.03, 0.04, 0.05, 0.10):
row = [lot_cost(p, f) for f in (0, 0.25, 0.5, 1)]
best = "none" if p < K1 / K2 else "all" if p > K1 / K2 else "tie"
print(" %.2f " % p + "".join("%7.1f " % x for x in row) + best)
MIX = [(0.01, 0.8), (0.15, 0.2)]
def p_zero(n, p):
return (1 - p) ** n
def sample_plan(n):
terms = []
for p, w in MIX:
pz = p_zero(n, p)
c = n * K1 + (1 - pz) * (N - n) * K1 + pz * (N - n) * p * K2
terms.append(w * c)
return math.fsum(terms)
none = MIX[0][1] * lot_cost(MIX[0][0], 0) + \
MIX[1][1] * lot_cost(MIX[1][0], 0)
allc = N * K1
best_n = min(range(1, N), key=lambda n: (sample_plan(n), n))
print("unstable mix: none %.1f h, all %.1f h per lot" % (none, allc))
for n in (5, 10, best_n, 40, 80):
print(" sample n=%3d then decide: %6.1f h" % (n, sample_plan(n)))
print("best n = %d saves %.1f h per lot against the better boundary" % (
best_n, min(none, allc) - sample_plan(best_n)))
print("perfect knowledge of p per lot would cost %.1f h" % (
math.fsum(w * lot_cost(p, 0 if p < K1 / K2 else 1) for p, w in MIX)))Single source and citation
Fan, Y. (2026). Distributed Multi-City Team Coordination, Asynchronous Deliverable Verification and Regional Talent Allocation across KL, Taipei and HCMC (Version 1.0.0), Chapter 4: Acceptance Sampling: Operating Characteristics, the kp Rule and the Boundaries of All or None. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-340 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026340,
author = {Fan, Yafu},
title = {Distributed Multi-City Team Coordination, Asynchronous Deliverable Verification and Regional Talent Allocation across KL, Taipei and HCMC},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · One Time Zone Is Not Zero Coordination Cost: Shared Windows, Hands and Review Queues
- Chapter 2 · An Interior Optimum for Task Granularity: Handoff Loss, Brooks's Channels and Cross-City Assignment
- Chapter 3 · A Protocol for Asynchronous Handoff: Batch Interval, Inbox Rhythm and the Edge of the Day
- Chapter 5 · When the Defect Rate Is Unknown or Drifts: Bayesian Updating, Sample Size and the Inspection Interval
- Chapter 6 · The Incentive Slope: Noise, Risk Aversion, Multitask Crowding Out and Several Currencies
- Chapter 7 · Classical Sources East and West: Dividing the People Well in the Guanzi, and the Division of Labour in Babbage and Taylor
- Chapter 8 · Closing the Empirical Loop: a Weekly Three-City Ledger, a Calculator and Pre-Registered Tests