June 2006
Beginner
793 pages
20h 59m
English
The steps involved in the computation of Latest Finish Time for each node (LF) are as follows:
| Step 1→ | Identify all the activities leading back to each node. |
| Step 2→ | Calculate the sum of expected time of each set of activities leading back to each node. |
| Step 3→ | Calculate the maximum of sum of expected time of each set of activities (as per step 2). |
| Step 4→ | Calculate latest finish Time by taking out the difference between critical path duration and the maximum of sum of expected time (as per step 3). |
The aforesaid calculations may be presented in the form of following table:
Table Showing the Computation of Latest Finish Time (L)
Read now
Unlock full access