关于「布鲁克斯定律:n(n-1)/2 条通道与迟到项目里的新人」,《团队规模的协调边界》给出的定量结论是什么?

结论:两人只有一条通道,三人三条,四人六条,八人二十八条,十二人六十六条,五十人则是 1,225 条。人数翻倍时,通道数从两人翻到四人是六倍,从四人翻到八人是 4.67 倍,人数越多越接近四倍,因为通道数本质上是人数的平方。每个成员要维持的通道是 n-1 条,所以每人花在通道上的时间与人数成正比:四人时每人每周 0.037 的时间花在通道上,八人时 0.087,二十人时 0.237,五十人时 0.613。按这个示意参数,团队到八十一人时,每个人的全部时间都会被通道吃掉。

数据口径:书中参数为示意;全部计算由书中程序生成;本书属于非个人化经营建议。 第四章以本出版局每波四卷并行为示意场景:容量峰值在 6.78 个窗口,四个窗口已拿到峰值的 89.6 %,协调者的审稿队列把上限压在四。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.037, 0.087, 0.237, 0.613, 1225, 4.67

nchannelsper memberx when doubledweek share
100.0-0.000
210.56.000.013
331.05.000.025
461.54.670.037
5102.04.500.050
6152.54.400.062
8283.54.290.087
10454.54.220.113
12665.54.180.138
161207.54.130.188
201909.54.110.237
50122524.54.040.613
members at which channels eat the whole week: 81
channels at n = 50: 1,225
查看完整验算程序
# Chapter 2. p21: pairwise channels n(n-1)/2 against headcount.
# Brooks (1975): if every part of a task must be coordinated with every
# other part, intercommunication effort grows as n(n-1)/2. Columns:
# channels, channels per member (n-1)/2, the ratio of channels when the
# team doubles, and the share of a 40-hour week each member spends on
# channels if every channel costs h = 0.5 hour per member per week
# (illustrative).
H = 0.5
WEEK = 40.0


def channels(n):
    return n * (n - 1) // 2


if __name__ == "__main__":
    print("   n  channels  per member  x when doubled  week share")
    for n in (1, 2, 3, 4, 5, 6, 8, 10, 12, 16, 20, 50):
        ch = channels(n)
        dbl = channels(2 * n) / ch if ch else float("nan")
        share = H * (n - 1) / WEEK
        dtxt = "{:14.2f}".format(dbl) if ch else "             -"
        print("  {:2d}  {:8d}  {:10.1f}  {}  {:10.3f}"
              .format(n, ch, (n - 1) / 2, dtxt, share))
    n_full = 1 + int(WEEK / H)
    print("members at which channels eat the whole week: {}".format(
        n_full))
    print("channels at n = 50: {:,}".format(channels(50)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《林格曼效应与布鲁克斯定律、团队与智能体军团规模的协调开销最优边界母典》第 2 章「布鲁克斯定律:n(n-1)/2 条通道与迟到项目里的新人」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026322,
  author    = {Fan, Yafu},
  title     = {The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论