Backward Deadline Planner

Planning arithmetic only—not a delivery promise or optimal schedule. Durations, resource labels, calendars, dependencies, and fixed constraints are assumptions. The resource heuristic may not find a feasible schedule even when one exists.

Dependencies are predecessor IDs separated by commas: each predecessor must finish before this task starts. A task’s buffer is reserved after that task before every successor. Fixed dates use the selected working calendar; date-only fixed finish means end of that workday. Resource heuristic processes successors first and shifts same-resource flexible tasks earlier until they no longer overlap.

JSON / CSV import and local save