What does Zero-Ticket Interfaces and Self-Service State Machines conclude, in numbers, about “Progress Transparency and the Residual Human Desk: a Chase Model and Erlang C”?

Answer: Chapter 6 shows chases per hundred orders falling from 41.0 to 16.5 as visible milestones go from none to two, and uses Erlang C to show that a small shop saves busy time rather than staff.

Scope of the numbers: Parameters are illustrative and all calculations come from the book's programs; the book is general business analysis, not individual or legal advice. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

中文版

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: 16.5, 41.0

nodeswidth_dchases/100 orderslate share
0241.00.350
2216.50.350
4210.30.350
627.40.350
0636.90.142
2614.90.142
469.10.142
666.70.142
Show the full program
# Chapter 6. p61: chase messages versus visible progress nodes
# 2,000 orders per cell, lead time lognormal (median 10 days, log-sd
# 0.25). k visible progress nodes are spread evenly over the lead time;
# the promised window is centred on 10 days with width w days. Hourly
# chase hazard = 0.0003 x (hours since last news / 24), tripled once
# the promised window has closed (an unexplained late wait). A reply to
# a chase counts as news. Shape follows Maister 1985 and the boundary
# found by Buell and Norton 2011 (their study: 62 and 63 percent chose
# the transparent wait at 30 and 60 seconds, 42 and 23 percent the
# opaque one; Buell, Kim and Tsay 2017 report quality up 22.2 percent
# and throughput time down 19.2 percent with two-way transparency);
# all magnitudes here are illustrative.
import math
import random


def cell(k, w):
    rng = random.Random(40161)
    chases = 0
    late = 0
    end = (10 + w / 2) * 24
    for _ in range(2000):
        lead = 24 * 10 * math.exp(rng.gauss(0, 0.25))
        news = [lead * (j + 1) / (k + 1) for j in range(k)]
        if lead > end:
            late += 1
        last = 0
        for t in range(1, int(lead) + 1):
            if news and t >= news[0]:
                last = news.pop(0)
            h = 0.0003 * (t - last) / 24
            if t > end:
                h *= 3
            if rng.random() < h:
                chases += 1
                last = t
    return chases / 20, late / 2000


print("nodes  width_d  chases/100 orders  late share")
for w in (2, 6):
    for k in (0, 2, 4, 6):
        c, l = cell(k, w)
        print("{:>5}  {:>7}  {:>17.1f}  {:>10.3f}".format(k, w, c, l))

Single source and citation

Fan, Y. (2026). Zero-Ticket Self-Repairing Order Interfaces, Self-Service Correction State Machines and Pre-Emptive Support Elimination (Version 1.0.0), Chapter 6: Progress Transparency and the Residual Human Desk: a Chase Model and Erlang C. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-401 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026401,
  author    = {Fan, Yafu},
  title     = {Zero-Ticket Self-Repairing Order Interfaces, Self-Service Correction State Machines and Pre-Emptive Support Elimination},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book