Twinworks Buffer Allocation Optimiser

Distribute a fixed number of buffer places over a line for maximum throughput.

Model or project JSON

A Twinworks project (.twinworks.json, format "twinworks-project") or a bare model with "nodes" and "links". Times in seconds, lengths in metres. Leave empty and pick a template instead.

Or start from a template

Total buffer places

Places to distribute over the buffers. Default: the sum of the current capacities (same space, better placement).

Minimum per buffer

Buffer ids

Comma-separated ids (e.g. B1,B2,B3). Default: every buffer with a finite capacity.

Replications per candidate

Run length per replication h

Overrides the model setting.

☁ Sign in to save to your Google Drive

Try an example: Bottleneck demo: 8 places over four buffers · 3-station line: redistribute the current 10 places

How it works

Solves the buffer allocation problem of a production line by simulation: a fixed total of buffer places (for example the floor space you have) is distributed over the buffers so that throughput is as high as possible. Greedy marginal allocation with common random numbers, compared against the current allocation with a paired confidence interval.

Every buffer starts at the minimum capacity; then, one place at a time, each buffer is tried with one more place and the place goes to the buffer with the highest mean throughput (ties: lower mean lead time). This greedy marginal allocation is the standard heuristic for the buffer allocation problem of serial lines.
All candidates use the same random-number seeds (common random numbers), so differences are caused by the allocation and not by noise; the gain over the current allocation is a paired Student-t interval.

Greedy allocation is a heuristic: it is optimal or near-optimal for typical serial lines but not guaranteed for every network. Confirm the result with more replications in the app.

Sources

Law, A. M.: Simulation Modeling and Analysis, 5th ed. (McGraw-Hill, 2015) — event scheduling, replications, confidence intervals (McGraw-Hill)
Roser, Nakano & Tanaka: A practical bottleneck detection method (Winter Simulation Conference 2001) (WSC)
Hopp & Spearman: Factory Physics, 3rd ed. — Little’s law, VUT/Kingman equation, line throughput (Waveland Press)
Nakajima, S.: Introduction to TPM — Overall Equipment Effectiveness = availability × performance × quality (Productivity Press)
Little, J. D. C.: A proof for the queuing formula L = λW (Operations Research 9(3), 1961)

For scripts and AI agents

JSON API: POST https://apps.usefulweb.site/api/v1/tools/twinworks-buffer-allocation/calculate (same calculation as this page)
Interface description: OpenAPI 3.1 · AI guide: llms.txt
MCP server (Streamable HTTP): https://apps.usefulweb.site/mcp · tool name twinworks_buffer_allocation

Example request

curl -s -X POST https://apps.usefulweb.site/api/v1/tools/twinworks-buffer-allocation/calculate \
  -H 'content-type: application/json' \
  -d '{"template":"bottleneck-buffer-sizing","total":8,"replications":3,"horizonHours":6}'

Related tools

Twinworks Buffer & Parameter Sweep – Sweep a buffer size (or any parameter) and get the throughput curve with confidence intervals.
Twinworks Bottleneck Analysis – Find the constraint of a production line and test fixes: ranked bottlenecks with what-if gains.
Twinworks Factory Simulation – Simulate a production line: throughput, lead time, WIP, OEE and the bottleneck, with CIs.