What does Three-City Teams: Handoffs and Acceptance conclude, in numbers, about “An Interior Optimum for Task Granularity: Handoff Loss, Brooks's Channels and Cross-City Assignment”?

Answer: Task granularity has an interior optimum, and the optimal number of pieces moves as \(\sqrt{((1-f)-\delta)\,T/H}\). The same work is best cut into 4 pieces in one office, 2 in a three-city team without a handoff protocol, and 3 with one. Brooks's channel count reminds us that with people split evenly over three cities, two thirds of the channels in an all-to-all structure cross a city line, while a three-hub structure cuts the number of channels to about three tenths. Cross-city assignment must write the handoff charge into its objective, or the exact optimum on hourly cost alone will create crossing after crossing.

Scope of the numbers: Its schedules, lunch breaks, cost coefficients, exchange-rate volatilities and price levels are illustrative, and all calculations are generated by its programs. It is general management guidance, not individual, legal or tax advice; labour, tax and work-pass matters in the three cities must be confirmed by licensed local advisers.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it.

k one office3 cities 3 cities+protocol
140.00 40.00 40.00
230.50 35.00 31.20
328.33 37.33 30.93
428.00 41.50 32.80
528.40 46.40 35.52
629.17 51.67 38.67
730.14 57.14 42.06
831.25 62.75 45.60
one office best k4, D = 28.00 h, D(8) - D(best) = 3.25 h
3 cities best k2, D = 35.00 h, D(8) - D(best) = 27.75 h
3 cities+protocol best k3, 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

Key formula

\[D(k) = T\,(f + (1-f)/k) + (k-1)\,H + (k-1)\,\delta\,T/k\]
Show the full program
# 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))

Single source and citation

Fan, Y. (2026). Distributed Multi-City Team Coordination, Asynchronous Deliverable Verification and Regional Talent Allocation across KL, Taipei and HCMC (Version 1.0.0), Chapter 2: An Interior Optimum for Task Granularity: Handoff Loss, Brooks's Channels and Cross-City Assignment. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book