What does Bottlenecks, Cannibalization and Advisory Pricing conclude, in numbers, about “A Queueing Network of Four Teams and Its Bottleneck”?

Answer: Chapter 1 writes content, acquisition, conversion and fulfilment as a Jackson queueing network: doubling the content team's capacity leaves the maximum throughput at 24.0 jobs a day, and only adding capacity at the conversion bottleneck raises it to 28.0.

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: 24.0, 28.0

   visit ratios: cont 1.000, acqu 1.250, conv 1.250, fulf 0.694
   base:
     utilisation 0.714 0.625 0.833 0.579
     WIP 12.33 jobs, lead time 0.617 days
     throughput 20.0/day; max sustainable 24.0/day
   content automated (mu x2):
     utilisation 0.357 0.625 0.833 0.579
     WIP 10.24 jobs, lead time 0.512 days
     throughput 20.0/day; max sustainable 24.0/day
   one more closer:
     utilisation 0.714 0.625 0.625 0.579
     WIP 9.36 jobs, lead time 0.468 days
     throughput 20.0/day; max sustainable 28.0/day
Show the full program
# Chapter 1. p01: An open Jackson network of four teams and its bottleneck.
# Each job is one customer journey: content -> acquisition -> conversion ->
# fulfilment. After conversion 20% go back to acquisition (retargeting),
# 50% go on to fulfilment and 30% leave unsold; 10% of fulfilment is
# reworked. Station i has c[i] servers of rate mu[i] jobs/day (M/M/c).
# Jackson's theorem: each station behaves as an independent M/M/c queue
# with the arrival rate solved from the traffic equations.
from math import factorial

NAMES = ("content", "acquisition", "conversion", "fulfilment")
ROUTE = ((0, 1.0, 0, 0), (0, 0, 1.0, 0), (0, 0.2, 0, 0.5), (0, 0, 0, 0.1))
BASE = {"c": (2, 1, 3, 2), "mu": (14.0, 40.0, 10.0, 12.0)}

def visits():
    v = [0.0] * 4
    for _ in range(500):
        v = [(1.0 if j == 0 else 0.0) + sum(v[i] * ROUTE[i][j]
                                            for i in range(4))
             for j in range(4)]
    return v

def mmc_L(lam, c, mu):
    rho = lam / (c * mu)
    if rho >= 1:
        return float("inf")
    a = lam / mu
    s = sum(a ** k / factorial(k) for k in range(c))
    top = a ** c / (factorial(c) * (1 - rho))
    pw = top / (s + top)                    # Erlang C: P(wait)
    return pw * rho / (1 - rho) + a         # queue + in service

def network(lam0, c, mu):
    v = visits()
    rho = [lam0 * v[i] / (c[i] * mu[i]) for i in range(4)]
    L = [mmc_L(lam0 * v[i], c[i], mu[i]) for i in range(4)]
    cap = min(c[i] * mu[i] / v[i] for i in range(4))
    return rho, L, sum(L) / lam0, cap

if __name__ == "__main__":
    lam0 = 20.0
    v = visits()
    print("   visit ratios: " + ", ".join(
        "{} {:.3f}".format(n[:4], x) for n, x in zip(NAMES, v)))
    cases = (("base", BASE["c"], BASE["mu"]),
             ("content automated (mu x2)", BASE["c"], (28.0, 40, 10, 12)),
             ("one more closer", (2, 1, 4, 2), BASE["mu"]))
    for name, c, mu in cases:
        rho, L, W, cap = network(lam0, c, mu)
        print("   {}:".format(name))
        print("     utilisation " + " ".join("{:.3f}".format(r)
                                             for r in rho))
        print("     WIP {:.2f} jobs, lead time {:.3f} days".format(
            sum(L), W))
        print("     throughput {:.1f}/day; max sustainable {:.1f}/day".format(
            lam0, cap))

Single source and citation

Fan, Y. (2026). Enterprise Bottleneck Diagnostics, SKU Cannibalization Audits and Automation Return Bounds (Version 1.0.0), Chapter 1: A Queueing Network of Four Teams and Its Bottleneck. 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