Project Time CalculatorProject Time Calculator

How to Calculate ES, EF, LS and LF in a Project Network

The forward and backward pass that produces earliest and latest start and finish for every task, and the project duration from maximum EF.

Quick answer

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.

Earliest start and finish

ES = max predecessor EF; EF = ES + duration.

Why four times per task

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.

Forward and backward pass

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.

Worked examples

Each example uses numbers you can load into the calculator above; the results match the tool exactly.

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.

Load this example

Example 2: a three-task chain A → B → C, durations 3, 4, 2

  • A: ES 0, EF 3. B: ES 3, EF 7. C: ES 7, EF 9. Project duration = 9.
  • Backward: C LF 9, LS 7. B LF 7, LS 3. A LF 3, LS 0.
  • Every task has zero slack: the whole chain is critical.

Load a larger network in the critical path calculator.

Load this example

Two predecessors, take the maximum

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.

Mapping times onto a calendar

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.

Lead time is not a negative duration

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.

Checking a hand calculation

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.

How to calculate ES, EF, LS and LF by hand

  1. List tasks, durations and predecessors. Check there is no cycle.
  2. Forward: tasks with no predecessor get ES = 0. EF = ES + duration. Each later ES is the max predecessor EF.
  3. Project duration is the largest EF.
  4. Backward: tasks with no successor get LF = project duration. LS = LF − duration. Each earlier LF is the min successor LS.
  5. Float is LS − ES. Zero means critical.

Assumptions, limits and common mistakes

Assumptions and limits

  • Finish-to-start only. Leads and lags need extra dummy tasks on this site.
  • No resource levelling: a person cannot be in two places, but the pass does not know that.

Common mistakes

  • Summing predecessor finishes instead of taking the maximum.
  • Starting the backward pass from zero instead of from the project duration.
  • Using calendar dates inside the pass without first converting them to working durations.

Frequently asked questions

How do you calculate early and late activity times in a project network?

Forward pass for ES and EF, backward pass for LF and LS. Project duration is max EF. Late times count back from that duration.

What is the difference between ES and LS?

ES is the soonest the task can start. LS is the latest it may start without delaying the project. The gap is total float.

Why is project duration the maximum EF?

Because some task is still working until that moment. Nothing else is still going after the last EF.

Do I need LS and LF if I only want the end date?

The forward pass is enough for the date. You need the backward pass to see which tasks you cannot slip.

Can EF be before ES?

Only if duration is negative, which is invalid. Check the inputs.

Where can I check a larger table?

The critical path calculator prints ES, EF, LS, LF, total float and free float together.

Written by . 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.