Homework SourseAssignment 2 Problems 1 Consider the project network diagram
Solution
Below table shows the calculation of ES,EF,LS,LF details are expalined after table finishes:
You can use a method called forward pass to add the early start and finish to each path in your network diagram. Once you’ve done that, you can use backward pass to add the late start and finish. It makes your network diagrams look a little more complicated, but it gives you a lot of valuable information.
To conduct the forward pass in the Precedence Diagram, start with the first activity in the schedule and place the project start date in the Early Start Time. The Early Finish Time of each activity is the Early Start Time plus the activity duration. The Early Finish Time of a given activity becomes the Early Start Time of its following activities. The forward pass is completed when every Early Start Time box on the network has a value.
Once the Forward Pass has been completed, the second part of the Critical Path Method, the \"Backward Pass\", may be performed. The backward pass tells you the latest time at which an event can occur. To keep track of the results of the Backward Pass on the precedence diagram, Late Time boxes are used at each node.
The first step in the backward pass is to copy the Early Finish Time of the last activity in the schedule to the Late Finish Time of the last activity in the schedule. If you have a project completion date, then use the overall project completion date for the last activity’s Late Finish Time.
Critical Path = 38 ( It is the longest path in network diagram )
| Activity | Duration (days) | ES | EF | LS | LF |
| A | 4 | 0 | 4 | 16 | 20 |
| B | 11 | 4 | 15 | 13 | 24 |
| C | 6 | 4 | 10 | 20 | 26 |
| D | 7 | 4 | 11 | 10 | 17 |
| E | 4 | 10 | 14 | 26 | 30 |
| F | 5 | 11 | 16 | 17 | 22 |
| G | 6 | 15 | 21 | 24 | 30 |
| H | 7 | 21 | 28 | 21 | 28 |
| I | 4 | 21 | 25 | 30 | 34 |
| J | 5 | 16 | 21 | 22 | 27 |
| K | 6 | 28 | 34 | 28 | 34 |
| L | 7 | 25 | 32 | 27 | 34 |
| M | 4 | 34 | 38 | 34 | 38 |
