Precedence Diagram (AON - Acitivty On Node)

0
6
Activity A
0 6 6
TF= 0
FF= 0
0
0
START
0 0 0
TF= 0
FF= 0
0
2
Activity B
1 2 3
TF= 1
FF= 0

6
9
Activity C
6 3 9
TF= 0
FF= 0

9
10
Activity F
11 1 12
TF= 2
FF= 2

12
15
Activity I
12 3 15
TF= 0
FF= 0

2
4
Activity D
5 2 7
TF= 3
FF= 2

9
12
Activity G
9 3 12
TF= 0
FF= 0

12
13
Activity J
14 1 15
TF= 2
FF= 2

15
17
Activity L
15 2 17
TF= 0
FF= 0

2
6
Activity E
3 4 7
TF= 1
FF= 0

6
12
Activity H
7 6 13
TF= 1
FF= 0

12
13
Activity K
13 1 14
TF= 1
FF= 0

13
16
Activity M
14 3 17
TF= 1
FF= 1

Legend:
Forward pass: EF = ES + D
ES

EF
Activity Description

LS

earliest start
earliest finish
latest start
latest finish
duration
Total Float (or Total Slack)
Free Float (or Free Slack)

Critical path 1: Start A C G I L N

Answers to assignment 1:

ESA=0; EFA=ESA+DA

1
2
3
4
5

ESB=EFA; EFB=ESB+DB; repeat in case a node has one predecessor

TF of J =

ESG=max(EFC,EFD); repeat in case a node has 2 or more predecessor

TF of F =

TF = LF - EF = LS - ES

8
9

FF of E =
FF of D =

0
2

10

# of critical paths =

LF

ES:
EF:
LS:
LF:
D:
TF:
FF:

Backward pass: LS = LF - D

FFcurrent = ESfollower - EFcurrent

e.g. FFJ = ESL - EFJ, FFC = min(ESF,ESG) - EFC

EF of G = 12
ES of H = 6
project duration = 21
LF of J = 15
LS of D = 5

17
21
Activity N
17 4 21
TF= 0