关于「四个团队的排队网络与瓶颈」,《瓶颈、自蚕食与顾问定价》给出的定量结论是什么?

结论:第一章把内容、投流、转化与履约写成杰克逊排队网络:把内容团队的产能翻倍,最大吞吐量仍是每天 24.0 件,只有转化瓶颈扩容才把它提高到 28.0 件。

数据口径:书中的团队产能、需求参数、毛利、噪声与合约参数均为示意或合成模型;全部数据由书中程序生成;本书不是投资、法律或税务意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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
查看完整验算程序
# 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))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《企业瓶颈诊断、产品线自蚕食审计与自动化改造回报边界》第 1 章「四个团队的排队网络与瓶颈」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090217

DOI: 10.5281/zenodo.24090217 · 阅读本章所在专著 · 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}
}

本书其他章节结论