What does Three-City Teams: Handoffs and Acceptance conclude, in numbers, about “A Protocol for Asynchronous Handoff: Batch Interval, Inbox Rhythm and the Edge of the Day”?

Answer: The optimal interval between batches of handoff notes is 1.83 hours, and handing everything over at the end of the day costs 2.57 times as much. Once inbox rhythm, lunch and the edge of the day are layered on top, a one-hour offset can be cancelled out or blown up into a whole night: handoffs that Ho Chi Minh City sends to Kuala Lumpur in its last hour wait 14.99 hours on average. Writing complete notes takes less effort than reading the inbox more often. The protocol decides H, and it decides delta too.

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.83, 2.57

batch everynotes/daymean waitcost per hour
0.5 h18.00.25 h1.075
1.0 h9.00.50 h0.650
1.5 h6.00.75 h0.558
2.0 h4.51.00 h0.550
3.0 h3.01.50 h0.617
4.5 h2.02.25 h0.786
9.0 h1.04.50 h1.406
b* = 1.83 h, cost 0.548 per hour, 4.93 batches per 9 h day
cost ratio of one end-of-day batch to b*: 2.57
cost ratio of sending every piece (b = 1/lam): 1.55
Show the full program
# Chapter 3. p31: how often to send asynchronous handoff batches.
# Finished pieces reach the outbox at lam = 1.5 per working hour. Each
# batch needs a written handoff note, K = 0.5 h of the sender's time
# (illustrative). A piece that sits in the outbox costs cw = 0.2 h of
# value per hour of waiting (delay cost, illustrative). Sending every b
# hours, the cost per working hour is
#   C(b) = K / b + lam * cw * b / 2,   minimised at b* = sqrt(2K/(lam cw))
# which is the economic-order-quantity rule applied to information. The
# mean outbox wait of a piece is b / 2.
import math

LAM, K, CW = 1.5, 0.5, 0.2


def cost(b):
    return K / b + LAM * CW * b / 2


bstar = math.sqrt(2 * K / (LAM * CW))
print("batch every  notes/day  mean wait  cost per hour")
for b in (0.5, 1.0, 1.5, 2.0, 3.0, 4.5, 9.0):
    print("%7.1f h %10.1f %9.2f h %12.3f" % (b, 9.0 / b, b / 2, cost(b)))
print("b* = %.2f h, cost %.3f per hour, %.2f batches per 9 h day" % (
    bstar, cost(bstar), 9.0 / bstar))
print("cost ratio of one end-of-day batch to b*: %.2f" % (
    cost(9.0) / cost(bstar)))
print("cost ratio of sending every piece (b = 1/lam): %.2f" % (
    cost(1 / LAM) / cost(bstar)))

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 3: A Protocol for Asynchronous Handoff: Batch Interval, Inbox Rhythm and the Edge of the Day. 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