ACTIVITY RELATIONSHIP TYPES

FINISH-TO-START START-TO-START

X Y X Y

FINISH-TO-FINISH START-TO-FINISH

X Y X Y
 Logic Diagram (PERT)
Forward Pass: calculates the earliest time each
activity in the network can start and finish. 3 3 5
Calculates the overall minimum network duration
B E G
5 8 11

INFORMATION of the NODE

(Activity-On-Node Diagram)

4 1 2 4 2

Duration Float A C F H I
1 5 8 11 16

110
ACTIVITY TITLE 3
Early Start = Early Finish of
D Predecessor + Duration (If
there are multiple
EarlySTart LateFTinish 5

predecessors use highest

number)
Logic Diagram (PERT)
Backward Pass: calculates the latest time that
each activity in the network can start and finish 3 3 5
with out changing the overall duration of the
network B E G
5 8 8 11 11 16

INFORMATION of the NODE

(Activity-On-Node Diagram)

4 1 2 4 2

Duration Float A C F H I
1 5 5 10 8 12 11 16 16 18

110
ACTIVITY TITLE 3
Late Finish = Successor
D Late Finish – Duration (If
there are multiple
EarlySTart LateFTinish 5 10

successors use the lowest

number)
Logic Diagram (PERT)
Finding Float 3 0 3 0 5 0

B E G
5 8 8 11 11 16

INFORMATION of the NODE

(Activity-On-Node Diagram)

4 0 1 4 2 2 4 1 2 0

Duration Float A C F H I
1 5 5 10 8 12 11 16 16 18

110
ACTIVITY TITLE 3 2

D
Float = Late Finish –
EarlySTart LateFTinish 5 10
Duration – Early Start
Logic Diagram (PERT)
Finding Critical Path 3 0 3 0 5 0

B E G
5 8 8 11 11 16

INFORMATION of the NODE

(Activity-On-Node Diagram)

4 0 1 4 2 2 4 1 2 0

Duration Float A C F H I
1 5 5 10 8 12 11 16 16 18

110
ACTIVITY TITLE 3 2

D
Critical Path Activities have
EarlySTart LateFTinish 5 10
0 Float