关于「推入瓶颈的工作、沟通通道与波动」,《瓶颈、自蚕食与顾问定价》给出的定量结论是什么?
结论:第二章改正「二次方膨胀」的说法:被推入瓶颈的在制品按双曲线增长(负荷 0.98 时 49.00 件),按二次方增长的是沟通通道;推入过多会让线索变冷,成交从 11.06 单降到 5.22 单;非瓶颈降低波动比提速更能帮助瓶颈(-22% 对 -5%)。
数据口径:书中的团队产能、需求参数、毛利、噪声与合约参数均为示意或合成模型;全部数据由书中程序生成;本书不是投资、法律或税务意见。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.98, 11.06, 49.00, 5.22
| (a) rho L=rho/(1-rho) | 0.5-matched quadratic 4*rho^2 |
| 0.50 | 1.00 1.00 |
| 0.80 | 4.00 2.56 |
| 0.90 | 9.00 3.24 |
| 0.95 | 19.00 3.61 |
| 0.98 | 49.00 3.84 |
| (b) leads/day WIP wait (h) closed sales/day | |
| 20.0 | 2.9 1.1 9.60 |
| 24.0 | 5.0 2.6 10.89 |
| 26.0 | 7.5 4.6 11.03 |
| 28.0 | 15.1 10.5 9.91 |
| 29.0 | 30.1 22.5 7.70 |
| 29.5 | 60.1 46.5 5.22 |
| most sales at 25.5 leads/day | 11.06 per day |
| (c) team size channels | |
| 4 | 6 |
| 6 | 15 |
| 8 | 28 |
| 12 | 66 |
查看完整验算程序
# 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))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《企业瓶颈诊断、产品线自蚕食审计与自动化改造回报边界》第 2 章「推入瓶颈的工作、沟通通道与波动」(版本 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}
}