What does Bottlenecks, Cannibalization and Advisory Pricing conclude, in numbers, about “Work Pushed into the Bottleneck, Communication Channels and Variability”?

Answer: Chapter 2 corrects the claim of a "quadratic blow-up": work in progress pushed into the bottleneck grows along a hyperbola (49.00 jobs at a load of 0.98), and what grows quadratically is the number of communication channels; pushing in too much lets leads go cold, and sales fall from 11.06 to 5.22 a day; reducing a non-bottleneck's variability helps the bottleneck more than speeding it up (-22% against -5%).

Scope of the numbers: Team capacities, demand parameters, margins, noise and contract parameters are illustrative or synthetic; all data are generated by its programs; the book is not investment, legal or tax advice. Marked boxes separate published evidence, runnable Python calculations (16 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: 0.98, 11.06, 49.00, 5.22

(a) rho L=rho/(1-rho)0.5-matched quadratic 4*rho^2
0.501.00 1.00
0.804.00 2.56
0.909.00 3.24
0.9519.00 3.61
0.9849.00 3.84
(b) leads/day WIP wait (h) closed sales/day
20.02.9 1.1 9.60
24.05.0 2.6 10.89
26.07.5 4.6 11.03
28.015.1 10.5 9.91
29.030.1 22.5 7.70
29.560.1 46.5 5.22
most sales at 25.5 leads/day11.06 per day
(c) team size channels
46
615
828
1266
Show the full program
# Chapter 2. p03: What pushing more work into the bottleneck does.
# (a) M/M/1 work in progress L = rho / (1 - rho) is hyperbolic in the
#     load, not quadratic: it diverges as rho -> 1.
# (b) Faster upstream teams release more leads into conversion (3
#     closers, 10 leads/day each). A lead waiting w days still closes with
#     probability p0 * exp(-w / T): leads go cold. For M/M/c the queue
#     wait has E[exp(-s W)] = (1 - Pw) + Pw * (c mu - lam) / (c mu - lam + s).
# (c) Coordination channels in a team of n people: n (n - 1) / 2.
from math import factorial

def erlang_c(lam, c, mu):
    a, rho = lam / mu, lam / (c * mu)
    s = sum(a ** k / factorial(k) for k in range(c))
    top = a ** c / (factorial(c) * (1 - rho))
    return top / (s + top)

C, MU, P0, T = 3, 10.0, 0.5, 1.0

def push(lam):
    pw = erlang_c(lam, C, MU)
    gap = C * MU - lam
    wq = pw / gap                                  # mean wait, days
    lq = lam * wq
    lt = (1 - pw) + pw * gap / (gap + 1 / T)       # E[exp(-W/T)]
    return lq + lam / MU, 24 * wq, lam * P0 * lt

if __name__ == "__main__":
    print("   (a) rho    L=rho/(1-rho)   0.5-matched quadratic 4*rho^2")
    for r in (0.5, 0.8, 0.9, 0.95, 0.98):
        print("       {:.2f}  {:13.2f}   {:10.2f}".format(
            r, r / (1 - r), 4 * r * r))
    print("   (b) leads/day  WIP  wait (h)  closed sales/day")
    best = max((push(l)[2], l) for l in [x / 2 for x in range(40, 60)])
    for lam in (20.0, 24.0, 26.0, 28.0, 29.0, 29.5):
        L, w, sold = push(lam)
        print("       {:9.1f}  {:5.1f}  {:7.1f}  {:8.2f}".format(
            lam, L, w, sold))
    print("       most sales at {:.1f} leads/day: {:.2f} per day".format(
        best[1], best[0]))
    print("   (c) team size  channels")
    for n in (4, 6, 8, 12):
        print("       {:9d}  {:8d}".format(n, n * (n - 1) // 2))

Single source and citation

Fan, Y. (2026). Enterprise Bottleneck Diagnostics, SKU Cannibalization Audits and Automation Return Bounds (Version 1.0.0), Chapter 2: Work Pushed into the Bottleneck, Communication Channels and Variability. 5D Library. https://doi.org/10.5281/zenodo.24090217

DOI: 10.5281/zenodo.24090217 · Read the monograph · 5DL-B-083 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026083,
  author    = {Fan, Yafu},
  title     = {Enterprise Bottleneck Diagnostics, SKU Cannibalization Audits and Automation Return Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090217},
  url       = {https://doi.org/10.5281/zenodo.24090217}
}

Other chapter answers in this book