All demonstrationsROBUST SCHEDULING / THREE CANDIDATES

Choose value with room for uncertainty.

Compare a bounded family of task selections, preserving their values while checking whether a declared success target is supported.

build_robust_planTry the real call

Concept artwork · not calculation evidence

01 / UNDERSTAND THE METHOD

See what the tool does.

ILLUSTRATION · NOT A CALCULATION

INTERACTIVE 3D / METHOD STUDYExplore the method in space.

Preparing the 3D exhibit…

Explore the cycleIllustration

A teaching illustration. Run the tool below to obtain a native calculation.Drag to inspect · arrow keys move the camera · no MCP call

02 / ASK THE ACTUAL TOOL

Time budget (minutes)Duration uncertainty (0–0.5)Required success probability (0–1)Sample countRandom seedCandidate plansDuration model

Complete tool arguments

Arrays, coordinates and nested contracts remain editable here. Units and limits are checked by the real tool.

Runs only when you press the button. Input edits discard the previous displayed result. Public compute limits apply.

KNOW WHAT THE RESULT MEANS

The conclusion is conditional on independent uniform duration uncertainty and the caller’s task values.
Only the bounded candidate family is compared; this is not global robust optimization over every possible schedule.
One composite MCP call produces real internal native events, not multiple external MCP calls.