Superbench 2.0 · Brief 19 · Planning & execution instrument

Last-Light Relay

Eight mandatory jobs. Two crews, one crane, sixteen ticks before dark. Compute the optimum, run the plan, then hold the line when the crane closes and replan around work already started.

  • 8 mandatory jobs
  • 2 crew units
  • 1 crane
  • horizon 0–16
  • nonpreemptive

Single file · no network
file:// ready

Execution and planning controls

Execution
0/ 16

No schedule accepted

No schedule yet. Solve the default scenario, or load the t=4 demonstration to freeze executed work and recover.

01 — Define

Work definition

Durations are editable 1–3 ticks. Crew, crane and predecessors are fixed.

Task definitions: crew and crane demand, predecessors, and editable duration
JobTaskCrewCranePred.Dur.
Crane closure u = v means no closure.

02 — Run

Execution

Play advances one tick per second. At tick t, jobs ending at t are complete.

Nowt = 0
G finishes—
Beaconunlit

Complete

    Running

      Pending

        03 — Schedule

        Accepted schedule

        No schedule yet

        Accepted start and end for every job, with resources, status and frozen markers
        JobTaskStartEndCrewCraneStatusFrozen
        No schedule accepted.

        Predecessor checks

          04 — Timeline

          Gantt chart

          Ticks run 0 → 16. Select a bar (click, or focus and press Enter) to link the island. Dashed violet outline = frozen by recovery.

          No crane closure.

          pending running complete frozen crane closure vertical amber line = execution tick
          05 — Resources

          Per-tick occupancy

          Each cell counts jobs occupying [tick, tick+1). Numbers are used units, colour repeats the value.

          Crew and crane occupancy for ticks 0 to 15
          tick

          No schedule accepted.

          06 — Station

          Island relay station

          Six station parts track six jobs. The beacon stays unlit until G completes.

          No schedule accepted.

          No task selected.

          07 — Evidence

          Why this plan

          Plain-English constraints and the exact search record. No hidden heuristic.

          09 — Test

          Manual start times

          Validate reports every violation and never moves a task. A valid manual plan is labelled manual; optimality not established.

          10 — Export

          JSON state

          Selectable text, no download. Configuration, schedule, execution and frozen tasks all read the same accepted schedule.

          11 — Use

          Operating instructions

          Everything runs offline in this single document.

          1. Define. Edit any duration to 1–3 and optionally set a crane closure [u, v) with 0 ≤ u ≤ v ≤ 16; u = v means no closure. Apply configuration. A valid edit invalidates the old schedule and resets execution to t=0; an invalid edit is rejected and the accepted configuration is kept.
          2. Solve. The exact branch-and-bound search either proves the earliest finish of G within the 16-tick horizon, or states “No feasible schedule within 16 ticks.” It never claims impossibility beyond the horizon.
          3. Run. Play advances one tick per second, Step advances one tick, Reset execution rewinds to t=0. Play stops at the final completion tick. The beacon lights only at G's actual end.
          4. Demonstrate. “Load t=4 demonstration” restores defaults, solves with no closure and pauses at exactly t=4. Then “Crane closure [5,7)” freezes every job starting strictly before 4 at its executed times, introduces the closure and replans the rest from t≥4. The action exists only in that paused state.
          5. Recover and rewind. Reset execution rewinds the selected schedule and, after a recovery, clears the frozen/comparison mode so the recovered schedule and closure are a normal scenario. Reset scenario restores default durations, no closure, no schedule and t=0.
          6. Test manually. Enter all eight start ticks and Validate. Violations cover domain, horizon, precedence, crew, crane and closure; nothing is silently moved. A clean manual plan can be simulated but is labelled unproven until Solve runs.

          Keyboard

          Model: nonpreemptive jobs on integer ticks. A job starting at s with duration d occupies [s, s+d) and releases exactly at s+d. Two crew units and one crane are available throughout. Every predecessor must finish no later than the job's start. All eight jobs are mandatory.