Creating an Activity Network Diagram

Forward Pass

Now, we can start with a forward pass to determine the early start and early finish dates, and on the last activity, the overall time to finish the whole project. It is an additive move through the network from start to finish.

  1. For two starting activities (A and B), ES is marked zero, which means that it is the very first day of the project (Figure 7.11).
Figure 7.11: ES and EF times
Figure 7.11: ES and EF times
  1. We add ES to the duration for each activity to find EF. For A, EF is (0+1) = 1 week, and for B, it is (0+2) = 2 weeks. It means that we can finish A at the end of the first week, and finish B at the end of the second week (Figure 7.11).
  2. Then, we carry the EF time to the nodes immediately succeeding the recently completed nodes (predecessors). C and D inherit 1 (EF) from A, and it becomes ES for both successor activities. For E, we pass 2 (EF for B) to E as the ES time. Then, we add new ES times to the duration of activities to find the EF for new successors (Figure 7.12).
Figure 7.12: Passing predecessor ES times to successors as EF times
Figure 7.12: Passing predecessor ES times to successors as EF times
  1. At a merge point, as is the case when C and D merge at F, we pass the highest EF time of predecessors (C and D) to the successor activity (F) (Figure 7.13). EF time of D becomes ES time for F.
Figure 7.13: Passing predecessor ES times at merge points
Figure 7.13: Passing predecessor ES times at merge points
  1. When the forward pass is done, we can generate all ES and EF times for all the activities. The EF of the last activity (M) gives us the overall duration of the project which is 15 weeks (Figure 7.14).
Figure 7.14: Completion of the forward pass
Figure 7.14: Completion of the forward pass