1
A group of workers is involved in a decorating project. The table shows the activities involved. Each worker can perform any of the given activities.
| Activity | A | \(B\) | C | D | \(E\) | \(F\) | G | H | I | \(J\) | \(K\) | \(L\) |
| Duration (days) | 2 | 5 | 6 | 7 | 9 | 4 | 3 | 2 | 3 | 2 | 3 | 1 |
| Number of workers required | 6 | 3 | 5 | 2 | 5 | 2 | 4 | 4 | 5 | 3 | 2 | 4 |
The activity network for the project is given in Figure 1 below.
- Find the earliest start time and the latest finish time for each activity, inserting their values on Figure 1.
- Hence find:
- the critical path;
- the float time for activity \(D\).
- \begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 1}
\includegraphics[alt={},max width=\textwidth]{172c5c92-4254-4593-b741-1caa83a1e833-02_647_1657_1640_180}
\end{figure} - The critical path is \(\_\_\_\_\)
- The float time for activity \(D\) is \(\_\_\_\_\)
- Given that each activity starts as early as possible and assuming that there is no limit to the number of workers available, draw a resource histogram for the project on Figure 2 below, indicating clearly which activities are taking place at any given time.
- It is later discovered that there are only 8 workers available at any time. Use resource levelling to construct a new resource histogram on Figure 3 below, showing how the project can be completed with the minimum extra time. State the minimum extra time required.
- \begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 2}
\includegraphics[alt={},max width=\textwidth]{172c5c92-4254-4593-b741-1caa83a1e833-03_586_1708_922_150}
\end{figure} - \begin{figure}[h]
\captionsetup{labelformat=empty}
\caption{Figure 3}
\includegraphics[alt={},max width=\textwidth]{172c5c92-4254-4593-b741-1caa83a1e833-03_496_1705_1672_153}
\end{figure}
The minimum extra time required is \(\_\_\_\_\)