Deadline Backplanner

Work backward from an exclusive finish date through calendar-day task durations and predecessor links.

Inputs stay on your device No sign-up Free to use
How this works

The tool runs in this browser. Your file or text is not uploaded to UseFreeTools. Check this tool's limits for anything it may save on your device.

Privacy details

Calculate result controls

Showing an example. Edit to see your own.

Work is complete at the start of this date. Calendar years 0001 to 9999; every calendar day is available.

One row per task: ID, name, whole calendar days, predecessor IDs. Separate columns with tabs and multiple predecessor IDs with commas. No header; up to 50 tasks and 3,650 days per task. Dependencies are finish-to-start.

Processed in your browser. Your inputs stay on this device.

How to use Deadline Backplanner

  1. Enter a deadline as the exclusive finish date.
  2. List task IDs, names, positive durations and predecessor IDs.
  3. Review the latest schedule, critical chain and slack under the stated model.

Example: Deadline Backplanner

A local worked example using the inputs and settings below for deadline backplanner.

You add
Exclusive project finish date: "2026-12-31" Tasks and dependencies: "A\tPlan\t2\t\nB\tBuild\t3\tA\nC\tReview\t1\tB"
You get
Start by 2026-12-25 to finish before 2026-12-31: 6 calendar days. A | Plan | 2 | | 2026-12-25 | 2026-12-27 | 0 | Yes B | Build | 3 | A | 2026-12-27 | 2026-12-30 | 0 | Yes C | Review | 1 | B | 2026-12-30 | 2026-12-31 | 0 | Yes deadline-backplan.csv

Options

Task durations
Durations are whole calendar days. They do not account for weekends, holidays, work hours or staffing.
Dependencies
Use the task IDs in the prerequisite column. Missing IDs and cycles are refused; parallel branches can overlap because resources are not scheduled.

Supported inputs and limits

1–50 tasks, ≤20,000 chars. TSV rows ID/name/whole calendar days/predecessors; ID letter then letters/digits/_/- up to24chars; name1–100chars no controls; duration1–3,650days. Gregorian0001–9999; strict valid DAG; unknown/duplicate/cycle/dateoverflow refused. Up to 50 tasks with positive whole calendar-day durations in a directed acyclic graph. Finish dates are exclusive and every day is available. No weekends, holidays, working hours, reminders, staffing or resource leveling are modeled.

Where your input is processed

This tool processes your input in this browser. Your text and files are not uploaded to UseFreeTools. Check this tool's limits for anything it may save on your device.

Latest dates need a resource review

The plan works backward from the entered deadline under its dependency rules. A valid dependency schedule can still assign two tasks to the same person on the same day. Check capacity and nonworking dates separately before treating the dates as commitments.

Questions about Deadline Backplanner

Is the finish date included as a working day?

No. It is the exclusive boundary. A one-day task finishing December 31 runs from December 30 to that boundary.

Can parallel tasks use the same person?

The mathematical graph allows parallel work. It does not check staffing or resource conflicts.

What is slack here?

It is the difference between the earliest and latest timing in this calendar-day dependency model, not spare staff or budget.

Project manager: Tony Hines · Content updated 4 October 2026 · Report a problem