关于「《管子》乘马与轻重乙、宋代市易与榷货务、《韩非子》循名而责实」,《瓶颈、自蚕食与顾问定价》给出的定量结论是什么?

结论:「循名而责实」是按职位的名分去考核实际的作为。用在企业诊断上,「名」是一个团队在例会上呈现的样子,最常见的就是每人每周登记的工时;「实」是它在工作流中的真实负荷。在示意数据中,登记工时最多的是投流团队(每周 57 小时),真正的瓶颈却是登记工时最少的转化团队(47 小时,负荷 0.833)。把资源给喊得最响的团队,产能一件也不会增加(0.00)。会议、返工与交接同样会填满工时,所以工时只是「名」,负荷才是「实」。

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

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.00, 0.833, 47, 57

teamhoursload+10% capacity: max flowlead time
content520.714+0.00/day-0.034 d
acquisition570.625+0.00/day-0.018 d
conversion470.833+2.40/day-0.096 d
fulfilment490.579+0.00/day-0.014 d
most hours logged: acquisition; bottleneck: conversion
capacity added: diagnosed 2.40/day, random 0.60/day, loudest 0.00/day
查看完整验算程序
# Chapter 7. p13: "Hold the name to the reality." In a review each team
# goes by the hours its people log per week (illustrative: meetings,
# rework and hand-offs fill hours too). The reality is the measured load
# of each queue in the network of p01, and what 10% more capacity there
# adds to the most it can carry and to its lead time at 20 jobs a day.
# A diagnosis is worth the gap between investing at the bottleneck and
# in a team picked at random, or in the team that logs the most hours.
import importlib.util

def load(name):
    spec = importlib.util.spec_from_file_location(name, name + ".py")
    m = importlib.util.module_from_spec(spec)
    spec.loader.exec_module(m)
    return m

p01 = load("p01_jackson_open")
C, MU = p01.BASE["c"], p01.BASE["mu"]
HOURS = (52, 57, 47, 49)          # logged hours per head per week

if __name__ == "__main__":
    rho0, _, w0, cap0 = p01.network(20.0, C, MU)
    print("   team         hours  load   +10% capacity: max flow  lead time")
    gains = []
    for i, name in enumerate(p01.NAMES):
        mu = list(MU)
        mu[i] *= 1.1
        _, _, w, cap = p01.network(20.0, C, mu)
        gains.append(cap - cap0)
        print("   {:<12} {:5d}  {:.3f}  {:+14.2f}/day  {:+9.3f} d".format(
            name, HOURS[i], rho0[i], cap - cap0, w - w0))
    loud = max(range(4), key=lambda i: HOURS[i])
    print("   most hours logged: {}; bottleneck: {}".format(
        p01.NAMES[loud], p01.NAMES[max(range(4), key=lambda i: rho0[i])]))
    print("   capacity added: diagnosed {:.2f}/day, random {:.2f}/day,"
          " loudest {:.2f}/day".format(max(gains), sum(gains) / 4,
                                       gains[loud]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《企业瓶颈诊断、产品线自蚕食审计与自动化改造回报边界》第 7 章「《管子》乘马与轻重乙、宋代市易与榷货务、《韩非子》循名而责实」(版本 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}
}

本书其他章节结论