关于「原典考辨:《孙子·虚实篇》、《孟子·离娄下》、塞涅卡第二封信与最小因子律」,《瓶颈定焦与价值工时比排程》给出的定量结论是什么?

结论:需求不足的那一周,需求是 12.00 单,产能有富余,订单就是 12.00 单。这时访客、第一道转化率、第二道转化率,无论抬高哪一个,订单都升到 13.20,弹性都是 1.00;两项产能的弹性都是 0.00。三个转化因素同等重要,不存在唯一要紧的一环。产能受限的那一周,需求已有 27.00 单,承接产能只有 15.00 单。这时只有承接产能的弹性是 1.00,抬高一成订单升到 16.50;三个转化因素与交付产能的弹性全是 0.00。

数据口径:史密斯 1956 年证明,单人面对一张清单,使加权延迟代价最小的次序是按价值除以耗时排序,而不是按价值排序;七件示意任务上,按重要性排比穷举最优多付 0.311。 图形学的视锥剔除与细节层次说明,固定帧预算下不该每件都精做:八件示意任务全部精做只做完三件,总价值只有最优安排的 0.783。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.00, 1.00, 12.00, 13.20, 15.00, 16.50

demand-bound: demand 12.00, orders 12.00
+10 % leverorderselasticity
visitors13.201.00
y113.201.00
y213.201.00
engage cap12.000.00
deliver cap12.000.00
capacity-bound: demand 27.00, orders 15.00
+10 % leverorderselasticity
visitors15.000.00
y115.000.00
y215.000.00
engage cap16.501.00
deliver cap15.000.00
查看完整验算程序
# Chapter 7. p72: where the law of the minimum holds and where it fails.
# Paid orders per week = min(demand, engage cap, deliver cap), where
# demand = visitors * y1 * y2 multiplies two conversion yields. Capacity
# limits combine by the minimum (Sprengel-Liebig); yields multiply, so
# every yield has the same elasticity while demand binds. Each lever is
# raised by 10 % in turn, in a demand-bound week and a capacity-bound
# week. Illustrative values.
LEVERS = ["visitors", "y1", "y2", "engage cap", "deliver cap"]


def orders(v):
    demand = v["visitors"] * v["y1"] * v["y2"]
    return min(demand, v["engage cap"], v["deliver cap"]), demand


WEEKS = {
    "demand-bound": {"visitors": 400.0, "y1": 0.15, "y2": 0.20,
                     "engage cap": 15.0, "deliver cap": 18.0},
    "capacity-bound": {"visitors": 900.0, "y1": 0.15, "y2": 0.20,
                       "engage cap": 15.0, "deliver cap": 18.0},
}
for name, v in WEEKS.items():
    base, dem = orders(v)
    print("%s: demand %.2f, orders %.2f" % (name, dem, base))
    print("  +10 % lever    orders   elasticity")
    for k in LEVERS:
        w = dict(v)
        w[k] = v[k] * 1.1
        o, _ = orders(w)
        print("  %-12s  %7.2f   %5.2f" % (k, o, (o / base - 1) / 0.1))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《阶段瓶颈动态定焦、价值工时比优先级排序与认知视锥渲染加速母典》第 7 章「原典考辨:《孙子·虚实篇》、《孟子·离娄下》、塞涅卡第二封信与最小因子律」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-376 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026376,
  author    = {Fan, Yafu},
  title     = {Stage-Bottleneck Triage, Weighted Shortest-Processing-Time Scheduling and Level-of-Detail Execution Velocity},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论