AQA D2 2010 January — Question 1

Exam BoardAQA
ModuleD2 (Decision Mathematics 2)
Year2010
SessionJanuary
TopicCritical Path Analysis
1 [Figures 1 and 2, printed on the insert, are provided for use in this question.]
Figure 1 shows the activity network and the duration, in days, of each activity for a particular project.
  1. On Figure 1:
    1. find the earliest start time for each activity;
    2. find the latest finish time for each activity.
  2. Find the float for activity \(G\).
  3. Find the critical paths and state the minimum time for completion.
  4. The number of workers required for each activity is shown in the table.
    Activity\(A\)\(B\)\(C\)\(D\)\(E\)\(F\)\(G\)\(H\)\(I\)\(J\)
    Number of workers required2232321352
    Given that each activity starts as late 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, indicating clearly which activities take place at any given time.
This paper (6 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6