| Exam Board | OCR |
|---|---|
| Module | D2 (Decision Mathematics 2) |
| Year | 2010 |
| Session | January |
| Marks | 15 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Critical Path Analysis |
| Type | Draw resource histogram |
| Difficulty | Standard +0.3 This is a standard Decision Maths 2 question covering routine critical path analysis techniques (activity networks, forward/backward pass, float calculation) and resource histograms. While multi-part with several steps, each component follows textbook procedures with no novel problem-solving required. Part (v) adds mild complexity by introducing a resource constraint, but the reasoning is straightforward. Slightly easier than average A-level due to the algorithmic nature of CPA. |
| Spec | 7.05a Critical path analysis: activity on arc networks7.05b Forward and backward pass: earliest/latest times, critical activities7.05c Total float: calculation and interpretation7.05d Latest start and earliest finish: independent and interfering float |
| Activity | Duration | Immediate predecessors | Number of workers |
| \(A\) | 6 | - | 2 |
| B | 5 | - | 4 |
| C | 4 | - | 1 |
| D | 1 | \(A , B\) | 3 |
| E | 2 | \(B\) | 2 |
| \(F\) | 1 | \(B , C\) | 2 |
| \(G\) | 2 | D, E | 4 |
| \(H\) | 3 | D, E, F | 3 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer/Working | Mark | Guidance |
| Correct structure, even without directions shown; activities must be labelled | M1 | |
| Completely correct, with exactly three dummies and all arcs directed | A1 |
| Answer | Marks | Guidance |
|---|---|---|
| Answer/Working | Mark | Guidance |
| Substantially correct attempt at forward pass (at most 1 independent error) | M1 | Follow through their activity network if possible |
| Substantially correct attempt at backward pass (at most 1 independent error) | M1 | |
| Both passes wholly correct | A1ft | |
| Minimum project completion time \(= 10\) hours | B1 | 10 hours (with units) cao |
| Either \(B, E, H\) or \(A, D, H\) (possibly with other critical activities, but \(C, F, G\) not listed) | M1 | |
| Critical activities \(A, B, D, E, H\) (and no others) | A1 | cao |
| Answer | Marks | Guidance |
|---|---|---|
| Answer/Working | Mark | Guidance |
| A plausible resource histogram with no holes or overhangs | M1 | On graph paper |
| Axes scaled and labelled and histogram completely correct | A1 | cao |
| Answer | Marks | Guidance |
|---|---|---|
| Answer/Working | Mark | Guidance |
| 1 hour | B1 | Accept 1 (with units missing) cao |
| Answer | Marks | Guidance |
|---|---|---|
| Answer/Working | Mark | Guidance |
| \(G\) and \(H\) cannot happen at the same time, so they must follow one another; this causes a 2 hour delay | M1, A1 | \(G\) and \(H\) cannot happen together (stated, not just implied from diagram); 2 cao |
| \(F\) could be delayed until 1 hour before \(H\) starts; \(H\) should be started as late as possible \(\Rightarrow\) maximum delay of 3 hours | B1, B1 | Diagram or explaining that for max delay on \(F\), need \(H\) to happen as late as possible; 3 cao |
# Question 3:
## Part (i)
| Answer/Working | Mark | Guidance |
|---|---|---|
| Correct structure, even without directions shown; activities must be labelled | M1 | |
| Completely correct, with exactly three dummies and all arcs directed | A1 | |
## Part (ii)
| Answer/Working | Mark | Guidance |
|---|---|---|
| Substantially correct attempt at forward pass (at most 1 independent error) | M1 | Follow through their activity network if possible |
| Substantially correct attempt at backward pass (at most 1 independent error) | M1 | |
| Both passes wholly correct | A1ft | |
| Minimum project completion time $= 10$ hours | B1 | 10 hours (with units) cao |
| Either $B, E, H$ or $A, D, H$ (possibly with other critical activities, but $C, F, G$ not listed) | M1 | |
| Critical activities $A, B, D, E, H$ (and no others) | A1 | cao |
## Part (iii)
| Answer/Working | Mark | Guidance |
|---|---|---|
| A plausible resource histogram with no holes or overhangs | M1 | On graph paper |
| Axes scaled and labelled and histogram completely correct | A1 | cao |
## Part (iv)
| Answer/Working | Mark | Guidance |
|---|---|---|
| 1 hour | B1 | Accept 1 (with units missing) cao |
## Part (v)
| Answer/Working | Mark | Guidance |
|---|---|---|
| $G$ and $H$ cannot happen at the same time, so they must follow one another; this causes a 2 hour delay | M1, A1 | $G$ and $H$ cannot happen together (stated, not just implied from diagram); 2 cao |
| $F$ could be delayed until 1 hour before $H$ starts; $H$ should be started as late as possible $\Rightarrow$ maximum delay of 3 hours | B1, B1 | Diagram or explaining that for max delay on $F$, need $H$ to happen as late as possible; 3 cao |
---
3 The table lists the duration (in hours), immediate predecessors and number of workers required for each activity in a project.
\begin{center}
\begin{tabular}{|l|l|l|l|}
\hline
Activity & Duration & Immediate predecessors & Number of workers \\
\hline
$A$ & 6 & - & 2 \\
\hline
B & 5 & - & 4 \\
\hline
C & 4 & - & 1 \\
\hline
D & 1 & $A , B$ & 3 \\
\hline
E & 2 & $B$ & 2 \\
\hline
$F$ & 1 & $B , C$ & 2 \\
\hline
$G$ & 2 & D, E & 4 \\
\hline
$H$ & 3 & D, E, F & 3 \\
\hline
\end{tabular}
\end{center}
(i) Draw an activity network, using activity on arc, to represent the project. You should make your diagram quite large so that there is room for working.\\
(ii) Carry out a forward pass and a backward pass through the activity network, showing the early and late event times clearly at the vertices of your network.
State the minimum project completion time and list the critical activities.\\
(iii) Using graph paper, draw a resource histogram to show the number of workers required each hour. Each activity begins at its earliest possible start time. Once an activity has started it runs for its duration without a break.
A delay from the supplier means that the start of activity $F$ is delayed.\\
(iv) By how much could the start of activity $F$ be delayed without affecting the minimum project completion time?
Suppose that only six workers are available after the first four hours of the project.\\
(v) Explain carefully what delay this will cause on the completion of the project. What is the maximum possible delay on the start of activity $F$, compared with its earliest possible start time in part (iii), without affecting the new minimum project completion time? Justify your answer.
\hfill \mbox{\textit{OCR D2 2010 Q3 [15]}}