4 The table shows the activities involved in a project, their durations in hours and their immediate predecessors. The activities can be represented as an activity network.
| Activity | A | B | C | D | E | F | G | H |
| Duration | 2 | 4 | 5 | 4 | 3 | 3 | 2 | 4 |
| Immediate predecessors | - | A | - | A, C | B, C | B, D | D, E | F, G |
- Use standard algorithms to find the activities that form
- the longest path(s)
- the shortest path(s)
through the activity network.
You must show working to demonstrate the use of the algorithms.
Only one of the paths from part (a) has a practical interpretation. - What is the practical interpretation of the total weight of that path?
The duration of activity E can be changed. No other durations change.
- What is the smallest increase to the duration of E that will make activity E become part of a longest path through the network?