Critical path schedule

Start after the latest predecessor finish; work backward for late starts and slack. Review your assumptions.

The example value has been entered. Check it immediately or change the value.

Input is processed in the browser. Refreshing returns a sample value.

Result

Instructions and example

Start after the latest predecessor finish; work backward for late starts and slack.

The project duration is 9; C has slack 2.

Use name,duration,predecessors per row; separate predecessors with ;. Cycles and duplicate names are rejected; resources are unlimited. Each list supports 100 rows and 20000 characters per input; names containing commas are unsupported. Critical path output is limited to 1000 paths.

Frequently asked questions

How do merged dependency paths determine a start?

Start after the latest predecessor finish; work backward for late starts and slack.

Why can task C start later in the public schedule?

The project duration is 9; C has slack 2.

Calculation criteria and reference materials

The calculation formula and scope of this tool are disclosed in the above description. Examples can be checked by substituting input values into the formula or following the specified string and calendar handling rules.

Verification of calculation criteria: · Calculation·verification principles · Report errors