June 2006
Beginner
793 pages
20h 59m
English
The steps involved in the computation of Earliest Start Time for each node (E) are as follows:
| Step 1→ | Identify all the activities leading to each node. |
| Step 2→ | Calculate the sum of expected Time of each set of activities leading to each node. |
| Step 3→ | Calculate the maximum of the sum of expected time of each set of activities (as per step 2). |
The aforesaid calculations may be presented in the form of following table:
Table Showing the Computation of Earliest Start Time (E)
Read now
Unlock full access