Optimize deadline recovery plan

Choose a budget-feasible deadline recovery plan over a dependency DAG using correlated triangular task durations, uncertain acceleration effects, common random numbers, probability-gain-per-cost search, and backward pruning.

What it's for

Advances Gitrevio from reporting a late-project probability to showing which concrete acceleration actions can credibly recover the commitment and what they cost.

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
common_shock_sigma number ≥ 0, ≤ 1.5 Your calibration Optional
deadline_days number > 0 Your calibration Yes
max_detail_rows integer ≥ 1, ≤ 500 Numerical control Optional
maximum_selected_actions integer ≥ 1, ≤ 20 Your calibration Optional
recovery_actions array of objects (8 fields) Evidence Yes
recovery_budget number ≥ 0 Your calibration Yes
seed integer Numerical control Optional
simulations integer ≥ 200, ≤ 20000 Numerical control Optional
target_on_time_probability number > 0.5, ≤ 1 Your calibration Optional
tasks array of objects (5 fields) ≥ 2 items Evidence Yes

Each recovery_actions record

Field Type Required
cost number (≥ 0) Yes
duration_multiplier_high number (≥ 0.01, ≤ 1) Yes
duration_multiplier_likely number (≥ 0.01, ≤ 1) Yes
duration_multiplier_low number (≥ 0.01, ≤ 1) Yes
exclusion_group string (non-empty) Optional
id string (non-empty) Yes
requires array of string Optional
task_id string (non-empty) Yes
Example input
{
  "deadline_days": 26,
  "recovery_actions": [
    {
      "cost": 10,
      "duration_multiplier_high": 0.55,
      "duration_multiplier_likely": 0.45,
      "duration_multiplier_low": 0.35,
      "id": "accelerate-build",
      "task_id": "build"
    },
    {
      "cost": 10,
      "duration_multiplier_high": 0.55,
      "duration_multiplier_likely": 0.45,
      "duration_multiplier_low": 0.35,
      "id": "accelerate-release",
      "task_id": "release"
    }
  ],
  "recovery_budget": 20,
  "seed": 29,
  "simulations": 200,
  "target_on_time_probability": 0.8,
  "tasks": [
    {
      "depends_on": [],
      "duration_high_days": 14,
      "duration_likely_days": 10,
      "duration_low_days": 8,
      "id": "design"
    },
    {
      "depends_on": [
        "design"
      ],
      "duration_high_days": 14,
      "duration_likely_days": 10,
      "duration_low_days": 8,
      "id": "build"
    },
    {
      "depends_on": [
        "build"

Truncated for display — the full payload is 52 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
{
  "baseline": {
    "expected_completion_days": 31.4343,
    "on_time_probability": 0.14,
    "p50_completion_days": 31.1827,
    "p90_completion_days": 38.1382
  },
  "decision": "deadline_recovery_plan_ready",
  "interpretation": "This is a scenario-calibrated recovery plan, not a guaranteed deadline; action costs and duration effects require accountable local estimates.",
  "method": "common_random_number_stochastic_deadline_recovery_greedy_v1",
  "optimized": {
    "expected_completion_days": 19.9204,
    "on_time_probability": 0.955,
    "p50_completion_days": 19.9153,
    "p90_completion_days": 24.2495,
    "probability_uplift": 0.815,
    "selected_action_count": 2,
    "total_cost": 20,
    "unused_budget": 0
  },
  "sample": {
    "candidate_actions": 2,
    "common_shock_sigma": 0.15,
    "dependency_edges": 2,
    "remaining_tasks": 3,
    "simulations": 200
  },
  "search": {
    "evaluated_plans": 4,
    "global_optimum_guaranteed": false,
    "strategy": "forward_probability_gain_per_cost_with_backward_pruning"
  },
  "search_trace": [
    {
      "action_id": "accelerate-release",
      "cumulative_cost": 10,
      "on_time_probability": 0.55,
      "probability_gain": 0.41,
      "step": 1
    },
    {
      "action_id": "accelerate-build",
      "cumulative_cost": 20,
      "on_time_probability": 0.955,

Truncated for display — the full payload is 67 lines.

How it works

Constrained optimization — Pick the best feasible option under real limits — budget, headcount, dependencies, capacity — rather than ranking a list and hoping it fits.

  1. 1 Choose a budget-feasible deadline recovery plan over a dependency DAG using correlated triangular task durations, uncertain acceleration effects, common random numbers, probability-gain-per-cost search, and backward pruning.
  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

  • Objectives use commensurable locally governed value units, constraints reflect real feasibility, and uncertainty covers plausible adverse inputs.
  • The recommendation is optimal only for its stated objective, feasible set, evidence, and solver guarantee; it is not a universal management optimum.

Minimum evidence

  • tasks: at least 2 rows/items
  • recovery_actions: required and organization-defined
  • deadline_days: required and organization-defined
  • recovery_budget: required and organization-defined

How to validate it

Backtest the chosen action against simple feasible baselines on held-out scenarios, sweep costs/constraints/risk tolerance, and require constraint feasibility under adverse inputs.

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

  • remaining-task dependency DAG
  • task-level triangular remaining-duration scenarios
  • deadline and required on-time confidence
  • candidate acceleration actions, prerequisites, and exclusions
  • finance-owned costs and locally estimated uncertain duration effects
  • recovery budget and common schedule-shock calibration

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": "choose a budgetfeasible deadline recovery plan" }
  → finds "optimize_deadline_recovery_plan"

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

gitrevio_capability_run
  { "capability_id": "optimize_deadline_recovery_plan", "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

Audit metric regime stability

Detect practical structural breaks across aggregate metric histories with recursive max-CUSUM search, moving-block null resampling, and familywise false-alarm control, then identify the defensible baseline regime.

Statistical audit & measurement

Infer stability selected temporal metric graph

Infer a compact aggregate temporal dependency graph with a chronologically held-out ridge VAR, moving-block coefficient bootstrap, practical-effect stability selection, and false-discovery control.

Network & dependency analysis

Aggregate risk register copula

Aggregate risk-register occurrence and lognormal severity marginals through a validated Gaussian copula into expected loss, VaR, CVaR, dependence amplification, and tail shares.

Statistical audit & measurement

Allocate restless bandit interventions

Allocate scarce recurring interventions across evolving Markov units with Whittle indices, explicit indexability checks, and paired policy simulation.

Sequential Bayesian & bandits

Attribute commercial dependency tail loss

Calculate expected loss, VaR and CVaR for commercial value concentrated in shared technical components, then allocate every modeled tail-loss dollar exactly once across components with normalized negative-log survival hazard rather than overlapping leave-one-out sensitivities.

Forecasting & survival

Audit commercial resilience claim integrity

Audit resilience ROI claims against a unique commercial-source to technical-component graph: recompute each action's avoided loss under joint failure scenarios, cap support at graph-derived value, detect duplicate effects, probability drift and weak evidence, and prevent overlapping component benefits from being sold twice.

Network & dependency analysis

See every tool in Risk, tails & resilience →

Ready to See Your Engineering work clearly?

Request a free demo