Earliest Start (ES)
Earliest start is the soonest a task can begin once every predecessor has finished.
ES = 0 if a task has no predecessors; otherwise ES = max(EF of predecessors).
Earliest start and finish
ES = max predecessor EF; EF = ES + duration.
The forward pass through a network sets earliest start for every task. You begin at tasks with no predecessors (ES = 0 in the usual convention on this site: time zero is the project start). Each later task cannot start before the latest of its predecessors has finished.
ES is not a calendar date until you pin time zero to a start date. It is a duration from the start of the project. A task with ES = 8 and duration 5 has earliest finish 13.
If two predecessors finish at 6 and 9, ES is 9, not 6. Taking the average or the sum is a common exam mistake. The critical path calculator does this pass for you.
Formula
ES = max(EF of predecessors) (0 if none)
Owning tool: How to calculate ES, EF, LS and LF.
Related terms: Earliest finish ยท Latest start.
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.