Simulate delivery flow digital twin

Simulate delivery as a network of finite queues with stochastic arrivals, lognormal service, rework, WIP limits, and policy economics.

What it's for

Models delivery as a queue network with finite WIP, rework and stochastic service — which is what a delivery pipeline is, and what a burndown chart cannot represent.

Upgrades What-If from scalar multipliers to a delivery-system digital twin that identifies bottlenecks and compares operating policies.

What you give it

Inputs split into evidence read from your connected systems, calibration your team owns, and numerical controls that affect precision but never the result's meaning.

Field Type Role Required
arrival_rate_per_day number > 0 Your calibration Yes
backlog_cost_per_item_day number ≥ 0 Your calibration Optional
horizon_days number ≥ 2 Your calibration Yes
policies array of objects (3 fields) Evidence Yes
seed integer Numerical control Optional
simulations integer ≥ 50 Numerical control Optional
sla_days number > 0 Your calibration Yes
stages array of objects (7 fields) Evidence Yes
value_per_completion number Your calibration Optional
warmup_days number ≥ 0 Your calibration Yes
wip_cost_per_item_day number ≥ 0 Your calibration Optional

Each stages record

Field Type Required
id string (non-empty) Yes
rework_probability number (≥ 0, ≤ 1) Optional
rework_to string (non-empty) Optional
server_cost_per_day number (≥ 0) Optional
servers integer (≥ 1) Yes
service_median_days number (> 0) Yes
service_sigma number (≥ 0, ≤ 3) Yes
Example input
{
  "arrival_rate_per_day": 1,
  "backlog_cost_per_item_day": 3,
  "horizon_days": 60,
  "policies": [
    {
      "id": "add_reviewer",
      "stage_overrides": [
        {
          "additional_daily_cost": 18,
          "servers": 2,
          "stage_id": "review"
        }
      ]
    }
  ],
  "seed": 9,
  "simulations": 50,
  "sla_days": 8,
  "stages": [
    {
      "id": "build",
      "server_cost_per_day": 15,
      "servers": 2,
      "service_median_days": 0.4,
      "service_sigma": 0.25
    },
    {
      "id": "review",
      "rework_probability": 0.08,
      "rework_to": "build",
      "server_cost_per_day": 20,
      "servers": 1,
      "service_median_days": 1.2,
      "service_sigma": 0.35
    },
    {
      "id": "deploy",
      "server_cost_per_day": 10,
      "servers": 1,
      "service_median_days": 0.2,
      "service_sigma": 0.2
    }
  ],

Truncated for display — the full payload is 48 lines.

What you get back

This is the actual output of running the example above — computed by the same function the platform calls, not an illustration.

Example output
{
  "assumptions": [
    "Arrival and service distributions must be calibrated from comparable work; policy results are conditional on those inputs.",
    "A WIP limit holds excess demand in an intake backlog, so cycle time and backlog must be interpreted together.",
    "The simulator models aggregate delivery capacity, not individual productivity."
  ],
  "method": "delivery_flow_discrete_event_twin_v1",
  "model": {
    "arrival_process": "poisson",
    "horizon_days": 60,
    "paired_random_numbers": true,
    "service_time_family": "lognormal",
    "simulations_per_policy": 50,
    "warmup_days": 15
  },
  "policies": [
    {
      "average_intake_backlog": {
        "mean": 0,
        "p05": 0,
        "p50": 0,
        "p95": 0
      },
      "average_wip": {
        "mean": 2.65,
        "p05": 1.69,
        "p50": 2.45,
        "p95": 4.39
      },
      "bottleneck_stage": "review",
      "cycle_time_days": {
        "p50": 2.364,
        "p75": 3.201,
        "p90": 4.311
      },
      "ending_intake_backlog": {
        "mean": 0,
        "p05": 0,
        "p50": 0,
        "p95": 0
      },
      "ending_wip": {
        "mean": 2.3,
        "p05": 0,

Truncated for display — the full payload is 171 lines.

How it works

Network & dependency analysis — Trace how load, failure and knowledge propagate through a graph of teams, services or components.

  1. 1 Simulate delivery as a network of finite queues with stochastic arrivals, lognormal service, rework, WIP limits, and policy economics.
  2. 2 Evaluate the method-specific diagnostics and gates returned by the function, then abstain unless the declared decision clears them under locally governed thresholds.

Before you trust it

Every tool in the catalog ships with the conditions under which its answer is meaningful — and the conditions under which it should abstain instead of guessing.

Assumptions & guardrails

  • Nodes, edges, direction, time window, missing-link policy, and aggregation boundary represent the coordination or dependency mechanism of interest.
  • Structural centrality, fragility, or clustering describes a modeled graph and must not be interpreted as intent, guilt, or personal value.

Minimum evidence

  • stages: required and organization-defined
  • policies: required and organization-defined
  • arrival_rate_per_day: required and organization-defined
  • horizon_days: required and organization-defined
  • warmup_days: required and organization-defined
  • sla_days: required and organization-defined

How to validate it

Validate on held-out periods or aggregate units, perturb edge definitions and missing links, and report sensitivity to graph construction before using structural rankings.

Calibrating it to your org

Same for everyone

The mathematical kernel, validation rules, method version, and JSON output semantics are organization-independent; no tenant-trained coefficients or company benchmark is embedded in the function.

Specific to you

  • metric/outcome definitions, entity grain, observation window, costs, thresholds, priors, and constraints represented by the function inputs

Calibration workflow

  1. 1 Define the management decision, target outcome, aggregate unit, privacy boundary, cadence, and prediction/intervention horizon for this organization.
  2. 2 Build a tenant-scoped historical cohort using only information available before each prediction or decision; preserve zero periods, censoring, assignment probabilities, and unresolved outcomes when the method requires them.
  3. 3 Estimate statistical parameters on training history, but obtain costs, utilities, risk tolerance, practical-effect thresholds, capacity, and policy constraints from accountable decision owners.
  4. 4 Validate on later time windows or held-out aggregate units at the deployment grain, against a simple baseline and the function-specific validation strategy.
  5. 5 Deploy only if the returned decision clears evidence, overlap, calibration, robustness, and guardrail checks; warning, unsupported, schema-gap, and fallback decisions are abstentions.
  6. 6 Monitor realized outcomes, data drift, coverage, and decision regret; recalibrate at a governed cadence or after a detected regime/definition change, never merely because a stakeholder dislikes the result.

Call it from your AI

You don't wire up 388 tools in your MCP client. The GitRevio MCP server exposes 18 tools, three of which let an agent search the catalog, read a tool's schema, and run it — so the assistant finds this one on its own.

gitrevio_capabilities_search
  { "q": "simulate delivery as a network of" }
  → finds "simulate_delivery_flow_digital_twin"

gitrevio_capability_describe
  { "capability_id": "simulate_delivery_flow_digital_twin" }
  → returns the input schema and agent guidance shown on this page

gitrevio_capability_run
  { "capability_id": "simulate_delivery_flow_digital_twin", "arguments": { ... } }
  → returns the result shown above

Works in Claude Desktop, Claude Code, Cursor, Cline, Continue.dev, Goose and Aider. See the MCP server.

Related tools

See every tool in Capacity, staffing & flow →

Ready to See Your Engineering work clearly?

Request a free demo