What does Team Size under Coordination Overhead conclude, in numbers, about “Work Tables and the Pruning of Channels: Mesh, Star, Cells and Longest Job First”?
Answer: With two windows the work finishes in thirty-eight hours, a speed-up of 1.97; with three, in twenty-five hours, a speed-up of 3.00, an exact division; with four, in nineteen hours, a speed-up of 3.95 and an efficiency per window of 0.99. Up to this point the division costs almost nothing. With five windows longest job first gives seventeen hours against a theoretical bound of fifteen, a speed-up of only 4.41 and an efficiency of 0.88, because twelve tasks of unequal length cannot be shared evenly among five. Six windows return to thirteen hours and an efficiency of 0.96; seven give twelve hours and 0.89. With eight windows the largest window load falls to eleven hours, but the coordinator's twelve hours of review become the bottleneck, so completion still takes twelve hours, the speed-up stays at 6.25 and efficiency drops to 0.78.
Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice. Chapter 4 takes this bureau's four volumes in parallel per wave as an illustrative scene: capacity peaks at 6.78 windows, four windows already reach 89.6 % of the peak, and the coordinator's review queue holds the ceiling at four.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.78, 0.88, 0.89, 0.96, 0.99, 1.97
| work 75 agent-hours, review 12 coordinator-hours | |
| n LPT max lower bound makespan speed-up per agent | |
| 1 | 75 75 75 1.00 1.00 |
| 2 | 38 38 38 1.97 0.99 |
| 3 | 25 25 25 3.00 1.00 |
| 4 | 19 19 19 3.95 0.99 |
| 5 | 17 15 17 4.41 0.88 |
| 6 | 13 13 13 5.77 0.96 |
| 7 | 12 11 12 6.25 0.89 |
| 8 | 11 10 12 6.25 0.78 |
| table for n | 4 (agent: volumes, hours): |
| agent 1: [9, 6, 4] | 19 h |
| agent 2: [8, 6, 5] | 19 h |
| agent 3: [8, 6, 5] | 19 h |
| agent 4: [7, 7, 4] | 18 h |
Show the full program
# Chapter 6. p62: a division-of-labour table by longest job first.
# Twelve volumes with illustrative writing times in agent-hours are
# assigned to n agents by the LPT rule (longest remaining job to the
# least loaded agent; ties to the lowest agent number). Each volume
# then needs 1 hour of the single coordinator's review, which cannot be
# split. Makespan >= max(LPT load, total review). Integers throughout.
import heapq
import math
JOBS = [9, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4]
REVIEW = 1
def lpt(jobs, n):
heap = [(0, i, []) for i in range(n)]
for j in sorted(jobs, reverse=True):
load, i, got = heapq.heappop(heap)
heapq.heappush(heap, (load + j, i, got + [j]))
return sorted(heap, key=lambda t: t[1])
if __name__ == "__main__":
work = int(math.fsum(JOBS))
review = REVIEW * len(JOBS)
print("work {} agent-hours, review {} coordinator-hours".format(
work, review))
print(" n LPT max lower bound makespan speed-up per agent")
for n in range(1, 9):
loads = [t[0] for t in lpt(JOBS, n)]
lb = max(-(-work // n), max(JOBS))
span = max(max(loads), review)
print(" {:2d} {:7d} {:11d} {:8d} {:8.2f} {:9.2f}".format(
n, max(loads), lb, span, work / span, work / span / n))
print("table for n = 4 (agent: volumes, hours):")
for load, i, got in lpt(JOBS, 4):
print(" agent {}: {} -> {} h".format(i + 1, got, load))Single source and citation
Fan, Y. (2026). The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead (Version 1.0.0), Chapter 6: Work Tables and the Pruning of Channels: Mesh, Star, Cells and Longest Job First. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · Ringelmann's Two Sets of Numbers: Where "Half at Eight" Comes From and What the Rope Experiment Says
- Chapter 2 · Brooks's Law: n(n-1)/2 Channels and the Newcomers on a Late Project
- Chapter 3 · Serial Fractions and Pairwise Coherence: Amdahl's Ceiling and the Optimal Size under the Universal Scalability Law
- Chapter 4 · The Parallel Ceiling of an Agent Squad: How Many Volumes per Wave Pay Best
- Chapter 5 · Merge Conflicts as a Birthday Problem: Shared Files, Hot Files and Private Directories
- Chapter 7 · Classical Sources East and West: "Working in Common Is Slow" in the Lüshi Chunqiu and Ringelmann in 1913
- Chapter 8 · Closing the Loop: Agent Squad Ceilings, Work Tables and a Pre-Registered Test