AQA D2 2011 January — Question 1

Exam BoardAQA
ModuleD2 (Decision Mathematics 2)
Year2011
SessionJanuary
TopicPermutations & Arrangements
TypeAssignment/allocation matching problems

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.
ActivityA\(B\)CD\(E\)\(F\)GHI\(J\)\(K\)\(L\)
Duration (days)256794323231
Number of workers required635252445324
The activity network for the project is given in Figure 1 below.
  1. Find the earliest start time and the latest finish time for each activity, inserting their values on Figure 1.
  2. Hence find:
    1. the critical path;
    2. the float time for activity \(D\).
  3. \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}
    1. The critical path is \(\_\_\_\_\)
    2. The float time for activity \(D\) is \(\_\_\_\_\)
  4. 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.
  5. 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.
  6. \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}
  7. \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 \(\_\_\_\_\)