ES/EF Network

EF of A =
ES ES of A + 2
of A
A
Start 0 2
0 0

2
ES/EF Network

A
0 2

2 EF of B =
ES ES of B + 3
0
Start
0 of B
B
0 0 3

3
ES/EF Network

A C
0 2 2 4

2 2

Start
0 0

B
0 3

3
ES/EF Network

A C
0 2 2 4

2 2

Start
0 0
= Max (2, 3) D
0
3 7
B
0 3

3
4
ES/EF Network

A C
0 2 2 4

2 2

Start
0 0

B D
0 3 3 7

3 4
ES/EF Network

A C F
0 2 2 4 4 7

2 2 3

Start E H
0 0 4 8 13 15

0 4 2

B D G
0 3 3 7 8 13

3 4 5
Backward Pass
Begin with the last event and work backwards
Latest Finish Time Rule:
► If an activity is an immediate predecessor for just a
single activity, its LF equals the LS of the activity that
immediately follows it
► If an activity is an immediate predecessor to more than
one activity, its LF is the minimum of all LS values of all
activities that immediately follow it

LF = Min {LS of all immediate following activities}