The Forward Pass

An activity can't start until its slowest predecessor is done.

Before this Lesson

At the pump house, the pump can't go in until two crews are done: the foundation crew, finishing at the end of day 8, and the pipe crew, finishing at the end of day 7. Line up all the earlier work end to end and you'd say day 12, but those crews worked side by side. Wait only for the pipe crew and you'd set a pump on a foundation that isn't there. The pump goes in after day 8. Make that one call at every activity, left to right, and you get the whole job's earliest dates and its duration without listing a single path.

Wait for the last one

Two numbers say when an activity can happen at the earliest. Its early start (ES) is the soonest it can begin, and its early finish (EF) is the soonest it can be done, if it starts at its ES and takes its full duration.

Most questions count time the way a stopwatch does: the job starts at time 0, and time 8 means the end of day 8. Under this time-0 convention, an activity with no predecessors starts at 0. Every other activity has to wait until all of its immediate predecessors are done, so it waits for whichever finishes last. That makes the early start a maximum, never a sum: predecessors that ran side by side don't add up.

ES=max⁡(EF of the immediate predecessors)EF=ES+duration\begin{aligned} \text{ES} &= \max(\text{EF of the immediate predecessors}) \\ \text{EF} &= \text{ES} + \text{duration} \end{aligned}

The Handbook's Construction section prints these two rules in its Nomenclature: "ES = Early start = Latest EF of predecessors" and "EF = Early finish = ES + duration." It doesn't say when the first activities start. The question sets that, usually at time 0.

One pass, left to right

Applying those two rules box by box, from the start of the network to its end, is the forward pass. Here it is on the pump house from Activity Networks. Each box follows the Handbook's Activity-on-Node Annotation, with the early start at the top left and the early finish at the top right. The Handbook's box has more slots, for late dates and float, which The Backward Pass and Float fills in.

0 3 A 3 3 8 B 5 3 7 C 4 8 14 D 6 8 11 E 3 14 16 F 2 Key ES EF Activity Duration
The forward pass on the pump house
At each merge, the accented arrow comes from the predecessor that finishes last, and it sets the start.

Box layout adapted from the FE Reference Handbook, Construction: Activity-on-Node Annotation

A runs from 0 to 3. B and C wait only for A, so both start at 3. D follows B, from 8 to 14. E, the pump, waits for B and C, which finish at 8 and 7, so it runs from 8 to 11. F waits for D and E, which finish at 14 and 11, so it runs from 14 to 16.

That's the same 16 days the longest path gave you before, and it's no coincidence. At each merge, the maximum keeps the longest route into that box and drops the shorter ones. So every early finish is the longest path ending with that activity, and the last one is the longest path through the job. The forward pass is path listing that throws away the losers as it goes, which is why it still works on a network with a thousand paths.

Worked Example A forward pass from a table
1 of 2

Time starts at 0. Find the project duration for this network.

Activities, durations, and predecessors
ActivityDaysImmediate predecessors
A4None
B6A
C3A
D5B
E7B, C
F2C
G4D, E, F

When several activities end the job

Not every network ends in one box. Suppose the pump house had no final test, F. Then D and E would both end the job, finishing at 14 and 11, and the job would be done when the later of them is: 14 days. The project duration is the largest early finish among all the activities with no successors. It's the max rule once more, as if a finish milestone waited for all of them, and some questions draw that milestone in as a box with a duration of 0.

Watch the order of the rows. A table lists activities by letter, not by when they finish, so the early finish of the last row is only that: the last row. Here it's E, at 11.

Checkpoint

Time starts at 0. What is the project duration?

Activities, durations, and predecessors
ActivityDaysImmediate predecessors
A6None
B4None
C5A
D9A, B
E2D
F3C
G4B
days

Counting from day 1

Some questions count the way a calendar does instead. Work starts on day 1, and an activity's dates are the first and last days it's worked on. An activity that starts on day 1 and takes 3 days is worked on days 1, 2, and 3, so it finishes on day 3, not day 4. Under this day-1 convention, a successor starts the day after its last predecessor finishes:

ES=max⁡(EF of the immediate predecessors)+1EF=ES+duration−1\begin{aligned} \text{ES} &= \max(\text{EF of the immediate predecessors}) + 1 \\ \text{EF} &= \text{ES} + \text{duration} - 1 \end{aligned}
Time (time-0 convention) 0 1 2 3 4 5 6 7 8 A (3 days) B (5 days) 1 2 3 4 5 6 7 8 Day (day-1 convention)
Two pump house activities, labeled both ways
Time-0 labels sit on the boundaries between days, and day-1 labels name the days themselves.

The schedule doesn't change, only its labels. Under time 0, B starts at 3, the instant A finishes. That instant is the morning of day 4, which is what the calendar calls it, and both conventions give B an early finish of 8. That holds on any network: every early finish comes out the same both ways, and every early start is one day later on the calendar. So the project duration doesn't change, and for a day-1 question you can run the time-0 pass and add 1 to each start.

The Handbook's rules are the time-0 version. The trouble comes from mixing the two, such as starting on day 1 and still using EF = ES + duration, which stretches every activity by a day. Use the convention the question sets, all the way through.

Checkpoint
1 of 2

Time starts at 0. What is the early start of F?

Activities, durations, and predecessors
ActivityDaysImmediate predecessors
A4None
B3None
C6A
D5A, B
E2B
F3C, D, E

When an activity slips

A forward pass also tells you what one change does to the finish. Only the changed activity and the ones after it can move, so rerun the pass from there and let each maximum decide whether the change gets through.

Say the pump takes 7 days instead of 3. E still starts at 8 but now finishes at 15. F waits for D at 14 and E at 15, so E governs, and F runs from 15 to 17. A 4-day delay to E costs the project 1 day. The first 3 days disappear, because E had been finishing 3 days ahead of D. The last one gets through, and A-B-E-F becomes the critical path. Give D the same 4-day delay instead, and F finishes at 20: the full 4 days, because F was already waiting for D.

A cut runs the same way in reverse: the project gains only until another predecessor becomes the latest at some merge, which is a parallel path taking over. How far an activity can slip for free is its float, which The Backward Pass and Float finds directly. For one change, a rerun is all you need.

Checkpoint
1 of 2

Here's the Worked Example's 21-day network, with its early dates filled in. If D is delayed so that it takes 10 days instead of 5, what is the new project duration?

Activities with their early dates
ActivityDaysPredecessorsESEF
A4None04
B6A410
C3A47
D5B1015
E7B, C1017
F2C79
G4D, E, F1721
days

Which end waits for which

So far, every arrow has meant that the successor can't start until the predecessor finishes. That's a finish-to-start (FS) link, the default. Real work overlaps more than that: a pipe crew starts laying pipe once the trench crew is a couple of days ahead, not when the whole trench is dug. Other link types tie other ends together. The Handbook's CPM Precedence Relationships figure sketches the first three of these:

  • Finish-to-start (FS): B can't start until A finishes.
  • Start-to-start (SS): B can't start until A starts.
  • Finish-to-finish (FF): B can't finish until A finishes.
  • Start-to-finish (SF): B can't finish until A starts, as when bypass pumping can't stop until a new pump station starts up. It's rare.

A lag shifts a link by a stated time. Forms that come off 3 days after the pour ends, so the concrete can cure, make an FS link with a 3-day lag. Slab placement that may begin 2 days after formwork begins makes an SS link with a 2-day lag. A lag is waiting, not work: nobody is on the clock while concrete cures, so it isn't an activity or part of either duration. The Handbook doesn't mention lags, so the question states them.

Finish-to-start (FS) A B lag Start-to-start (SS) A B lag Finish-to-finish (FF) A B lag Start-to-finish (SF) A B lag time
The four link types, each with a lag
Each connector runs from the end of A that's tied to the end of B it constrains. Its horizontal run is the lag.

To name a described link, ask which end of each activity the sentence mentions. "Begin" and "start" point to starts, and "finish," "complete," and "end" to finishes. The predecessor's end comes first in the name, and the time between the two ends is the lag.

Checkpoint
1 of 2

The tapers may begin once the drywall hangers have had a 3-day head start. As a link from hanging to taping, this is:

A.
Finish-to-start, with a 3-day lag
B.
Start-to-start, with a 3-day lag
C.
Finish-to-finish, with a 3-day lag
D.
Start-to-start, with no lag

Dates across a link

In the forward pass, every link works the same way: the date at the predecessor's tied end, plus the lag, is the earliest date for the successor's tied end. Under time 0, with A the predecessor and B the successor:

Forward-pass rules by link type
LinkWhat it setsRule
FSB's startESB=EFA+lag\text{ES}_B = \text{EF}_A + \text{lag}
SSB's startESB=ESA+lag\text{ES}_B = \text{ES}_A + \text{lag}
FFB's finishEFB=EFA+lag\text{EF}_B = \text{EF}_A + \text{lag}
SFB's finishEFB=ESA+lag\text{EF}_B = \text{ES}_A + \text{lag}

An ordinary arrow is FS with a lag of 0. Watch the SS lag: it counts from the predecessor's start, while that crew is still working, not from its finish.

Checkpoint
1 of 2

A footing pour has ES = 10 and takes 2 days. Column forms can't go up until 3 days after the pour finishes, to let the concrete cure. They also wait, with an ordinary finish-to-start link, for the column steel delivery, which has EF = 14. What is the early start of the column forms?

Several links into one activity

With link types in play, the max rule needs one adjustment, because some links set the successor's start and others set its finish. Turn every link into an earliest start. A link that sets the start gives one directly. A link that sets the finish gives one once you subtract the successor's duration: an activity that can't finish before time 20 and takes 5 days can't start before 15. Then take the latest of those starts, as always, and add the duration for the early finish.

Pipelines and other linear work often get an SS link and an FF link between the same two activities. The pipe crew can start once the trench crew is 2 days ahead, and it can't finish until a day after the trench is done, because it can't lay pipe in trench that isn't dug yet. The SS link keeps the second crew from starting too soon, and the FF link keeps it from catching up.

Worked Example A pipeline with overlapping crews
1 of 3

Time starts at 0, and lags are in days. Find the early dates of each activity and the project duration.

Activities and their incoming links
ActivityWorkDaysLinks in
AClear and grub3None
BDig trench10FS from A
CLay pipe8SS from B, lag 2; FF from B, lag 1
DBackfill6FF from C, lag 2

Recap

  • Under time 0, ES is the latest EF among the immediate predecessors (a maximum, never a sum), EF = ES + duration, and activities with no predecessors start at 0.
  • The project duration is the largest early finish among the activities with no successors, wherever they sit in the table. It equals the longest path.
  • Under day 1, EF = ES + duration − 1, and a successor starts the day after its last predecessor finishes. Finishes match the time-0 pass, and starts are a day later.
  • After a delay or a cut, rerun the pass from the changed activity. The finish moves only as far as the maximums let it, and a parallel path can take over.
  • A link ties one end of A to one end of B, and a lag shifts the tie: ESB=EFA+lag\text{ES}_B = \text{EF}_A + \text{lag} for FS, ESB=ESA+lag\text{ES}_B = \text{ES}_A + \text{lag} for SS, and EFB=EFA+lag\text{EF}_B = \text{EF}_A + \text{lag} for FF. Turn each link into an earliest start, subtracting the duration for a finish link, and take the latest.