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