关于「四十八小时是一个分布:模块工时之和、准时概率与规划谬误」,《演示先行与四十八小时交付》给出的定量结论是什么?
结论:第三、四章把四十八小时改写成准时概率:单点计划 12.50 小时的七模块订单,准时概率只有 0.846;示意目录的接单上限是 6 个模块;链尾缓冲承诺 14.73 小时、准时概率 0.997,逐项加垫只有 0.721;一个目录外接入就能把准时概率拖到 0.632。
数据口径:书中的赢率、工时、毛利、首付比例、月费与价格均为示意参数,以「单位」计,不对应任何币种、真实客户或真实成交;全部计算由书中程序生成。 本书不是法律意见,也不是个人化经营或理财建议,合同条款须由当地执业律师审阅;书中不写威胁催促、不写会重置的倒计时、不写收益承诺,推荐奖励只写单层。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.846, 12.50
single-point plan (all modes): 12.50 h of a 16 h window lane modes A 8.00 h, B 9.50 h lane means A 9.17 h, B 11.50 h; QA mean 3.00 h simulated mean 14.58 h, median 14.50 h P80 15.73 h, P95 16.98 h, P99 18.02 h P(delivered inside the window) = 0.846 P(plan itself is met) = 0.057
查看完整验算程序
# Chapter 3. p31: a 48-hour promise is a probability, not a date.
# Two builders work two normal 8-hour days inside the 48 elapsed hours,
# so each lane has a 16-hour window; nobody works extra hours. Each
# catalogue module takes a triangular(min, mode, max) number of hours;
# lanes run in parallel, then both builders do QA and handover.
# Delivery time = max(lane A, lane B) + QA. Module times are
# illustrative catalogue parameters. Fixed-seed Monte Carlo, N = 20,000.
import math
import random
rng = random.Random(20261120)
N = 20000
WINDOW = 16.0
LANE_A = [("domain on client account", 0.5, 1.0, 2.0),
("skin applied", 2.0, 3.0, 5.0),
("five content pages", 3.0, 4.0, 7.0)]
LANE_B = [("booking module", 2.0, 3.0, 6.0),
("payment link", 1.5, 2.5, 5.0),
("lead form to sheet", 1.0, 2.0, 4.0),
("message alerts", 1.5, 2.0, 4.0)]
QA = ("QA and handover", 2.0, 3.0, 4.0)
def draw(mod):
_, lo, mode, hi = mod
return rng.triangular(lo, hi, mode)
def plan(mods):
return math.fsum(m[2] for m in mods)
def mean(mods):
return math.fsum((m[1] + m[2] + m[3]) / 3 for m in mods)
times = []
for _ in range(N):
a = math.fsum(draw(m) for m in LANE_A)
b = math.fsum(draw(m) for m in LANE_B)
times.append(max(a, b) + draw(QA))
times.sort()
p_on = len([t for t in times if t <= WINDOW]) / N
single = max(plan(LANE_A), plan(LANE_B)) + QA[2]
print("single-point plan (all modes): {:.2f} h of a {:.0f} h window"
.format(single, WINDOW))
print("lane modes A {:.2f} h, B {:.2f} h".format(plan(LANE_A),
plan(LANE_B)))
print("lane means A {:.2f} h, B {:.2f} h; QA mean {:.2f} h".format(
mean(LANE_A), mean(LANE_B), mean([QA])))
print("simulated mean {:.2f} h, median {:.2f} h".format(
math.fsum(times) / N, times[N // 2]))
print("P80 {:.2f} h, P95 {:.2f} h, P99 {:.2f} h".format(
times[int(0.80 * N)], times[int(0.95 * N)], times[int(0.99 * N)]))
print("P(delivered inside the window) = {:.3f}".format(p_on))
print("P(plan itself is met) = {:.3f}".format(
len([t for t in times if t <= single]) / N))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《半成品演示先行逼单、四十八小时交钥匙系统交付与防需求蔓延母典》第 3 章「四十八小时是一个分布:模块工时之和、准时概率与规划谬误」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-368 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026368,
author = {Fan, Yafu},
title = {Demo-First B2B Closing, Forty-Eight-Hour Turnkey System Delivery and Scope-Creep Containment},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}