Step 2: Make a backwards pass through the network as follows: Move sequentially backwards from the Finish node to the Start node. At a given node, j, consider all activities ending at node j. For each of these activities, i, compute:
Latest Finish Time = the minimum of the latest start times beginning at node j. (For node N, this is the project completion time.)
Latest Start Time = (Latest Finish Time) - (Time to complete activity i ).