Example 1: duration 5 after a predecessor that finishes at 4
ES = 4, EF = 4 + 5 = 9. These are the mini-calculator defaults. If the task has no predecessor, ES = 0 and EF = 5.
The forward and backward pass that produces earliest and latest start and finish for every task, and the project duration from maximum EF.
Earliest start is the maximum earliest finish of the predecessors (0 if none). Earliest finish is ES plus duration. Latest finish is the minimum latest start of the successors (or the project duration). Latest start is LF minus duration. Those four numbers are the whole forward and backward pass.
ES = max predecessor EF; EF = ES + duration.
A network does not give you a date until you walk it twice. Forward: the soonest each task can start and finish. Backward: the latest it may start and finish without moving the end. The gap is slack. This page is the arithmetic; the critical path calculator is the table.
Definitions: ES, EF, LS, LF. Slack from those four numbers is in how to calculate slack time.
ES = max(EF of predecessors) (0 if none) EF = ES + duration
LF = min(LS of successors) (project duration if none) LS = LF − duration
Project duration is the maximum EF. Critical tasks have LS = ES.
Each example uses numbers you can load into the calculator above; the results match the tool exactly.
ES = 4, EF = 4 + 5 = 9. These are the mini-calculator defaults. If the task has no predecessor, ES = 0 and EF = 5.
Load a larger network in the critical path calculator.
If A finishes at 6 and B at 9, a successor C has ES = 9, not 7.5 and not 15. The work cannot start until both predecessors are done. That “max”, not a sum, is the rule people miss on exams.
ES and EF are durations from project start, not weekdays. Count that many working days with the project duration calculator once you have a start date.
A lead lets a successor start before its predecessor finishes. In a pure finish-to-start table like this site’s, you model that with a dummy or by shortening the predecessor on purpose, not by typing a negative duration. Negative duration makes EF fall before ES and the backward pass then lies. If the overlap is real (documentation starting while build is still going), split the predecessor or accept that this calculator is finish-to-start only. Lag is the opposite planned wait; it belongs on the link, not inside the successor’s duration, or you will double-count the wait when someone later adds lag on the same link.
After the forward pass, the largest EF is the project duration. After the backward pass, every task’s LS − ES should equal LF − EF. If those two slack figures disagree, an ES or LF is wrong. Zero-slack tasks should form a continuous path from the first task to the last; a zero-slack island in the middle with positive slack on both sides usually means a typing error in a predecessor. The critical path calculator prints all four times plus both floats so you can catch that without redrawing the network. Use the same duration unit everywhere: mixing days and hours in one table is a common way to get a duration of 200 “days” that was actually hours.
Forward pass for ES and EF, backward pass for LF and LS. Project duration is max EF. Late times count back from that duration.
ES is the soonest the task can start. LS is the latest it may start without delaying the project. The gap is total float.
Because some task is still working until that moment. Nothing else is still going after the last EF.
The forward pass is enough for the date. You need the backward pass to see which tasks you cannot slip.
Only if duration is negative, which is invalid. Check the inputs.
The critical path calculator prints ES, EF, LS, LF, total float and free float together.
Written by Umesh Manral. Formulas checked against the site's test suite on 11 November 2026. Last updated 10 November 2026. Formulas and tests: methodology. Report a calculation error.