Create the AoN and Identify the Critical Path

$1.$ Calculate the Early Finish for each activity $($Forward Algorithm$)$

o Early Finish $=$ Early Start $+$ Duration for each activity

o The ES for any activity is the greatest $($latest$)$ EF of any preceding activity, based upon the

network logic

$2.$ Calculate the Late Finish for each activity $($Backwards Algorithm$)$

a$.$ Late Start $=$ Late Finish $$ Duration for each activity

b$.$ The LF for any activity is the least $($earliest$)$ LS of any subsequent activity, based upon

the network logic

$3.$ Calculate the Total Float

a$.$ Total Float is the amount of time that an activity can be delayed without delaying

the total project

b$.$ It is the difference between the EF and the LF for each activity

$4.$ Identify the Critical Path

a$.$ Those activities where TF $=0$ are, by definition, on the Critical Path

Activity Duration $($Days$)$ Cost $($$$/$day$)$ Preceded By Followed By Early Start Late Start Total Float Free Float Early Finish Late Finish

A $2$ days $$500/$day $0$ B$,$ C$,$ D

B $3$ days $$900/$day A E

C $4$ days $$1600/$day A F

D $5$ days $$500/$day A G

E $7$ days $$1400/$day B H

F $7$ days $$1500/$day C I, L

G $8$ days $$2400/$day D J$,$ K

H $4$ days $$800/$day E L

I $2$ days $$1000/$day F N

J $12$ days $$3600/$day G M$,$ O

K $5$ days $$2000/$day G P

L $6$ days $$1200/$day F$,$ H Q

M $2$ days $$900/$day J N

N $2$ days $$700/$day I, M S

O $6$ days $$1800/$day J R$,$ T

P $4$ days $$1200/$day K T

Q $4$ days $$2000/$day L U

R $4$ days $$1600/$day O S

S $2$ days $$1400/$day N$,$ R V

T $9$ days $$1800/$day O$,$ P V

U $2$ days $$1200/$day Q V

V $3$ days $$300/$day S$,$ T$,$ U $0$