6.
| Activity | Duration (days) | Immediately preceding activities |
| A | 4 | - |
| B | 7 | - |
| C | 6 | - |
| D | 10 | A |
| E | 5 | A |
| F | 7 | C |
| G | 6 | B, C, E |
| H | 6 | B, C, E |
| I | 7 | B, C, E |
| J | 9 | D, H |
| K | 8 | B, C, E |
| L | 4 | F, G, K |
| M | 6 | F, G, K |
| N | 7 | F, G |
| P | 5 | M, N |
The table above shows the activities required for the completion of a building project. For each activity the table shows the duration, in days, and the immediately preceding activities. Each activity requires one worker. The project is to be completed in the shortest possible time.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{48e785c0-7de5-450f-862c-4dd4d169adf9-08_668_1271_1658_397}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
Figure 2 shows a partially completed activity network used to model the project. The activities are represented by the arcs and the numbers in brackets on the arcs are the times taken, in days, to complete each activity.
- Complete the network in Diagram 1 in the answer book by adding activities \(\mathrm { G } , \mathrm { H }\) and I and the minimum number of dummies.
- Add the early event times and the late event times to Diagram 1 in the answer book.
- State the critical activities.
- Calculate a lower bound for the number of workers needed to complete the project in the shortest possible time. You must show your working.
- Schedule the activities on Grid 1 in the answer book, using the minimum number of workers, so that the project is completed in the minimum time.