What does Three-City Teams: Handoffs and Acceptance conclude, in numbers, about “One Time Zone Is Not Zero Coordination Cost: Shared Windows, Hands and Review Queues”?
Answer: Chapters 1 to 3 show that a one-hour offset removes at most 1.00 hour of a 9-hour office day, while Kuala Lumpur and Taipei, on one clock, lose 2.00 hours to misaligned lunches; that 0.791 of the slowdown of cross-city work comes from the number of hands, and a pooled review board cuts waits by a factor of 3.71; that task granularity has an interior optimum, 4 pieces in one office but 2 across three cities; and that handoff notes are best batched every 1.83 hours, while handoffs sent from Ho Chi Minh City to Kuala Lumpur in its last hour wait 14.99 hours on average.
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. standard-library Python onlyprinted values that match the answer: 1.00, 2.00
| plan pair | office-hours overlap | minus lunches | lost to lunch | |
| A | KL-TPE | 9.00 h | 7.00 h | 2.00 h |
| A | KL-HCM | 9.00 h | 7.50 h | 1.50 h |
| A | TPE-HCM | 9.00 h | 7.00 h | 2.00 h |
| A | KL-TPE-HCM | 9.00 h | 7.00 h | 2.00 h |
| B | KL-TPE | 9.00 h | 7.00 h | 2.00 h |
| B | KL-HCM | 8.00 h | 6.50 h | 1.50 h |
| B | TPE-HCM | 8.00 h | 6.00 h | 2.00 h |
| B | KL-TPE-HCM | 8.00 h | 6.00 h | 2.00 h |
| one hour of offset costs at most 1.00 h of the 9.00 h office day |
Show the full program
# Chapter 1. p11: shared working windows of KL, Taipei and HCMC in UTC.
# Kuala Lumpur and Taipei keep UTC+8, Ho Chi Minh City keeps UTC+7.
# Working hours and lunch breaks below are illustrative, not survey data:
# KL 09:00-18:00 with lunch 13:00-14:00, Taipei 09:00-18:00 with lunch
# 12:00-13:30, HCMC either 08:00-17:00 (plan A) or 09:00-18:00 (plan B)
# with lunch 11:30-13:00. Minutes are counted on a one-minute grid.
import itertools
OFFSET = {"KL": 8 * 60, "TPE": 8 * 60, "HCM": 7 * 60}
def hm(text):
h, m = text.split(":")
return int(h) * 60 + int(m)
def busy_minutes(city, start, end, lunch0, lunch1):
off = OFFSET[city]
work = set(range(hm(start) - off, hm(end) - off))
lunch = set(range(hm(lunch0) - off, hm(lunch1) - off))
return work - lunch, work
PLANS = {
"A": {"KL": ("09:00", "18:00", "13:00", "14:00"),
"TPE": ("09:00", "18:00", "12:00", "13:30"),
"HCM": ("08:00", "17:00", "11:30", "13:00")},
"B": {"KL": ("09:00", "18:00", "13:00", "14:00"),
"TPE": ("09:00", "18:00", "12:00", "13:30"),
"HCM": ("09:00", "18:00", "11:30", "13:00")},
}
print("plan pair office-hours overlap minus lunches lost to lunch")
for plan in ("A", "B"):
avail, work = {}, {}
for city, args in PLANS[plan].items():
avail[city], work[city] = busy_minutes(city, *args)
groups = list(itertools.combinations(("KL", "TPE", "HCM"), 2))
groups.append(("KL", "TPE", "HCM"))
for g in groups:
w = set.intersection(*(work[c] for c in g))
a = set.intersection(*(avail[c] for c in g))
name = "-".join(g)
print(" %s %-12s %6.2f h %14.2f h %12.2f h" % (
plan, name, len(w) / 60, len(a) / 60, (len(w) - len(a)) / 60))
print("one hour of offset costs at most 1.00 h of the 9.00 h office day")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 1: One Time Zone Is Not Zero Coordination Cost: Shared Windows, Hands and Review Queues. 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
- Chapter 2 · An Interior Optimum for Task Granularity: Handoff Loss, Brooks's Channels and Cross-City Assignment
- Chapter 3 · A Protocol for Asynchronous Handoff: Batch Interval, Inbox Rhythm and the Edge of the Day
- Chapter 4 · Acceptance Sampling: Operating Characteristics, the kp Rule and the Boundaries of All or None
- Chapter 5 · When the Defect Rate Is Unknown or Drifts: Bayesian Updating, Sample Size and the Inspection Interval
- Chapter 6 · The Incentive Slope: Noise, Risk Aversion, Multitask Crowding Out and Several Currencies
- Chapter 7 · Classical Sources East and West: Dividing the People Well in the Guanzi, and the Division of Labour in Babbage and Taylor
- Chapter 8 · Closing the Empirical Loop: a Weekly Three-City Ledger, a Calculator and Pre-Registered Tests