Precedence Diagram (AON - Acitivty On Node)

0 6 6 9 9 10 12 15

0 6 6 6 3 9 11 1 12 12 3 15TF= 0 TF= 0 TF= 2 TF= 0FF= 0 FF= 0 FF= 2 FF= 0

0 0 2 4 9 12 12 13 15 17 17 21

0 0 0 5 2 7 9 3 12 14 1 15 15 2 17 17 4 21TF= 0 TF= 3 TF= 0 TF= 2 TF= 0 TF= 0FF= 0 FF= 2 FF= 0 FF= 2 FF= 0

0 2 2 6 6 12 12 13 13 16

1 2 3 3 4 7 7 6 13 13 1 14 14 3 17TF= 1 TF= 1 TF= 1 TF= 1 TF= 1FF= 0 FF= 0 FF= 0 FF= 0 FF= 1

Legend:ES: earliest startEF: earliest finish Critical path 1: Start A C G I L N

ES EF LS: latest startLF: latest finish Answers to assignment 1:D: duration

LS LF TF: Total Float (or Total Slack) 1 EF of G = 12FF: Free Float (or Free Slack) 2 ES of H = 6

3 project duration = 214 LF of J = 15

ESA=0; EFA=ESA+DA 5 LS of D = 5ESB=EFA; EFB=ESB+DB; repeat in case a node has one predecessor 6 TF of J = 2ESG=max(EFC,EFD); repeat in case a node has 2 or more predecessor 7 TF of F = 2TF = LF - EF = LS - ES 8 FF of E = 0FFcurrent = ESfollower - EFcurrent 9 FF of D = 2e.g. FFJ = ESL - EFJ, FFC = min(ESF,ESG) - EFC 10 # of critical paths = 1

D

Activity L

Activity A Activity C Activity F Activity I

START Activity D Activity G Activity J Activity N

Activity B Activity E Activity H Activity K Activity M

Forward pass: EF = ES + D

Activity Description

Backward pass: LS = LF - D