关于「切分粒度的内点最优:交接损耗、Brooks 通道与跨城指派」,《三城分布式团队协同与验收》给出的定量结论是什么?
结论:切分粒度有内点最优,最优块数按 \(\sqrt{((1-f)-\delta)\,T/H}\) 变化。同一份工作,在办公室里最优是 4 块,在没有交接协议的三城团队里是 2 块,加上协议回到 3 块。Brooks 的通道数提醒我们,人数平分在三座城市时,全连通结构里有三分之二的通道跨城;三中枢结构把通道压到约三成。跨城指派要把交接费写进目标,否则精确的单价最优会制造频繁跨城。
数据口径:书中的作息、午休、成本系数、汇率波动率与价格水平均为示意参数,全部计算由书中程序生成;本书是非个人化管理建议,不构成法律或税务建议,三城劳动、税务与准证事项须由当地持牌顾问确认;书中不以城市或国籍给任何人群贴标签,也不涉及任何多层分润。 书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。
| k one office | 3 cities 3 cities+protocol |
| 1 | 40.00 40.00 40.00 |
| 2 | 30.50 35.00 31.20 |
| 3 | 28.33 37.33 30.93 |
| 4 | 28.00 41.50 32.80 |
| 5 | 28.40 46.40 35.52 |
| 6 | 29.17 51.67 38.67 |
| 7 | 30.14 57.14 42.06 |
| 8 | 31.25 62.75 45.60 |
| one office best k | 4, D = 28.00 h, D(8) - D(best) = 3.25 h |
| 3 cities best k | 2, D = 35.00 h, D(8) - D(best) = 27.75 h |
| 3 cities+protocol best k | 3, D = 30.93 h, D(8) - D(best) = 14.67 h |
| one office continuous k* | 3.83 |
| 3 cities continuous k* | 1.91 |
| 3 cities+protocol continuous k* | 2.53 |
核心公式
\[D(k) = T\,(f + (1-f)/k) + (k-1)\,H + (k-1)\,\delta\,T/k\]
查看完整验算程序
# Chapter 2. p21: an interior optimum for how finely to split a deliverable.
# A deliverable of T = 40 working hours is cut into k pieces. Splitting
# buys parallel work (Amdahl: a serial share f = 0.3 cannot be split) but
# every one of the k - 1 boundaries costs a handoff wait H on the critical
# path and loses a share delta of the next piece, which must be redone.
# D(k) = T * (f + (1 - f) / k) + (k - 1) * H + (k - 1) * delta * T / k
# Scenarios (illustrative): one office with quick replies; three cities
# with the queue waits of p12; three cities with a written async protocol
# that shortens waits and halves the information lost per boundary.
T, F = 40.0, 0.3
SCEN = [("one office", 1.5, 0.15), ("3 cities", 6.0, 0.15),
("3 cities+protocol", 4.0, 0.06)]
def span(k, h, delta):
return T * (F + (1 - F) / k) + (k - 1) * h + (k - 1) * delta * T / k
print("k " + "".join("%19s" % s[0] for s in SCEN))
for k in range(1, 9):
print("%d " % k + "".join("%19.2f" % span(k, h, d) for _, h, d in SCEN))
for name, h, d in SCEN:
best = min(range(1, 41), key=lambda k: (span(k, h, d), k))
print("%-18s best k = %d, D = %.2f h, D(8) - D(best) = %.2f h" % (
name, best, span(best, h, d), span(8, h, d) - span(best, h, d)))
# continuous optimum: dD/dk = -(1 - f) T / k^2 + H + delta T / k^2 = 0
for name, h, d in SCEN:
kc = ((1 - F) * T - d * T) / h
print("%-18s continuous k* = %.2f" % (name, kc ** 0.5))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨时区多城市分布式团队协同、异步交付核验与区域人才配置效率母典》第 2 章「切分粒度的内点最优:交接损耗、Brooks 通道与跨城指派」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-340 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026340,
author = {Fan, Yafu},
title = {Distributed Multi-City Team Coordination, Asynchronous Deliverable Verification and Regional Talent Allocation across KL, Taipei and HCMC},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}