An upgrade to the supermarket requires the completion of 11 activities, \(A\) to \(K\). The directed network below shows these activities and their completion time, in weeks. The minimum completion time for the project is 29 weeks. --- 1 WORK AREA LINES (style=lined) --- --- 1 WORK AREA LINES (style=lined) --- Use the following information to answer parts c-e. A change is made to the order of activities. The table below shows the activities and their new latest starting times in weeks. \begin{array}{|c|c|} A dummy activity is now required in the network. --- 1 WORK AREA LINES (style=lined) ---
--- 1 WORK AREA LINES (style=lined) --- --- 1 WORK AREA LINES (style=lined) --- a. \(A, C, H, J\) b. \(\text{Activity E}\) c. d. \(\text{30 weeks}\) e. \($50\,000\) a. \(\text{Critical path: }A, C, H, J\) b. \(\text{Activity with the largest float time can be delayed the longest.}\) \(\text{Consider Activity E: EST = 11, LST}= 18-4=14\rightarrow\ \text{Float time = 3 weeks}\) \(\therefore\ \text{Activity E can be delayed the longest.}\) c. d. \(\text{New minimum completion time is 30 weeks}\) e. \(A\ \text{can be reduced by 2 weeks and }B, D,\ \text{and }H\ \text{can each be reduced by 1 week.}\) \(\therefore\ \text{Total reduction in weeks = 5}\ \rightarrow \ \text{Minimum payment}=$50\,000\)
\hline
\textbf{Activity} & \textbf{Latest Starting}\\
&\textbf{time} \text{(weeks)}\\
\hline A & 0 \\
\hline B & 2 \\
\hline C & 10 \\
\hline D & 9 \\
\hline E & 13 \\
\hline F & 14 \\
\hline G & 18 \\
\hline H & 17 \\
\hline I & 19 \\
\hline J & 25 \\
\hline K & 22 \\
\hline
\end{array}
Matrices, GEN1 2024 VCAA 37 MC
The network below represents paths through a park from the carpark to a lookout.
The vertices represent various attractions, and the numbers on the edges represent the distances between them in metres.
The shortest path from the carpark to the lookout is 34 m . This can be achieved when
- \(x=8\) and \(y=8\)
- \(x=9\) and \(y=7\)
- \(x=10\) and \(y=6\)
- \(x=11\) and \(y=5\)
Show Worked Solution
\(\text{Consider Option D}\ \rightarrow\ \ x=11, y=5\)
\(\Rightarrow D\)
This question doesn’t explicitly say that the shortest path includes \(x\) or \(y\) and is actually a critical path question.
Networks, GEN2 2023 VCAA 14
One of the landmarks in state \(A\) requires a renovation project.
This project involves 12 activities, \(A\) to \(L\). The directed network below shows these activities and their completion times, in days.
The table below shows the 12 activities that need to be completed for the renovation project.
It also shows the earliest start time (EST), the duration, and the immediate predecessors for the activities.
The immediate predecessor(s) for activity \(I\) and the EST for activity \(J\) are missing.
\begin{array} {|c|c|c|}
\hline
\quad \textbf{Activity} \quad & \quad\quad\textbf{EST} \quad\quad& \quad\textbf{Duration}\quad & \textbf{Immediate} \\
& & & \textbf{predecessor(s)} \\
\hline
\rule{0pt}{2.5ex} A \rule[-1ex]{0pt}{0pt} & 0 & 6 & - \\
\hline
\rule{0pt}{2.5ex} B \rule[-1ex]{0pt}{0pt} & 0 & 4 & - \\
\hline
\rule{0pt}{2.5ex} C \rule[-1ex]{0pt}{0pt} & 6 & 7 & A \\
\hline
\rule{0pt}{2.5ex} D \rule[-1ex]{0pt}{0pt} & 4 & 5 & B \\
\hline
\rule{0pt}{2.5ex} E \rule[-1ex]{0pt}{0pt} & 4 & 10 & B \\
\hline
\rule{0pt}{2.5ex} F \rule[-1ex]{0pt}{0pt} & 13 & 4 & C \\
\hline
\rule{0pt}{2.5ex} G \rule[-1ex]{0pt}{0pt} & 9 & 3 & D \\
\hline
\rule{0pt}{2.5ex} H \rule[-1ex]{0pt}{0pt} & 9 & 7 & D \\
\hline
\rule{0pt}{2.5ex} I \rule[-1ex]{0pt}{0pt} & 13 & 6 & - \\
\hline
\rule{0pt}{2.5ex} J \rule[-1ex]{0pt}{0pt} & - & 6 & E, H \\
\hline
\rule{0pt}{2.5ex} K \rule[-1ex]{0pt}{0pt} & 19 & 4 & F, I \\
\hline
\rule{0pt}{2.5ex} L \rule[-1ex]{0pt}{0pt} & 23 & 1 & J, K \\
\hline
\end{array}
- Write down the immediate predecessor(s) for activity \(I\). (1 mark)
--- 1 WORK AREA LINES (style=lined) ---
- What is the earliest start time, in days, for activity \(J\) ? (1 mark)
--- 1 WORK AREA LINES (style=lined) ---
- How many activities have a float time of zero? (1 mark)
--- 1 WORK AREA LINES (style=lined) ---
The managers of the project are able to reduce the time, in days, of six activities.
These reductions will result in an increase in the cost of completing the activity.
The maximum decrease in time of any activity is two days.
\begin{array} {|l|c|}
\hline
\rule{0pt}{2.5ex} \textbf{Activity} \rule[-1ex]{0pt}{0pt} & \quad \quad A \quad \quad & \quad \quad B \quad \quad& \quad \quad F \quad \quad & \quad \quad H \quad \quad & \quad \quad I \quad \quad & \quad \quad K \quad \quad \\
\hline
\rule{0pt}{2.5ex} \textbf{Daily cost (\$)} \rule[-1ex]{0pt}{0pt} & 1500 & 2000 & 2500 & 1000 & 1500 & 3000 \\
\hline
\end{array}
- If activities \(A\) and \(B\) have their completion time reduced by two days each, the overall completion time of the project will be reduced.
- What will be the maximum reduction time, in days? (1 mark)
--- 2 WORK AREA LINES (style=lined) ---
- The managers of the project have a maximum budget of $15 000 to reduce the time for several activities to produce the maximum reduction in the project's overall completion time.
- Complete the table below, showing the reductions in individual activity completion times that would achieve the earliest completion time within the $ 15 000 budget. (1 mark)
--- 0 WORK AREA LINES (style=lined) ---
\begin{array} {|c|c|}
\hline
\quad\textbf{Activity} \quad & \textbf{Reduction in completion time} \\
& \textbf{(0, 1 or 2 days)}\\
\hline
\rule{0pt}{2.5ex} A \rule[-1ex]{0pt}{0pt} & \\
\hline
\rule{0pt}{2.5ex} B \rule[-1ex]{0pt}{0pt} & \\
\hline
\rule{0pt}{2.5ex} F \rule[-1ex]{0pt}{0pt} & \\
\hline
\rule{0pt}{2.5ex} H \rule[-1ex]{0pt}{0pt} & \\
\hline
\rule{0pt}{2.5ex} I \rule[-1ex]{0pt}{0pt} & \\
\hline
\rule{0pt}{2.5ex} K \rule[-1ex]{0pt}{0pt} & \\
\hline
\end{array}
Show Worked Solution
a. \(\text{Immediate predecessors of}\ I:\ C, G\)
\(\text{Dummy activity before activity}\ C\ \text{does not effect this.}\)
b. \(\text{Scan network:}\)
\(\text{EST}(J) = 4+5+7 = 16\ \text{days}\)
c. \(\text{Critical Path:}\ A\ C\ I\ K\ L\)
\(\text{Activities on the critical path have a float time of zero.}\)
\(\Rightarrow \ \text{5 activities have a float time of zero.}\)
d. \(\text{If activities}\ A\ \text{and}\ B\ \text{are reduced by 2 days,}\)
\(\text{the critical path remains:}\ A\ C\ I\ K\ L\ \text{(22 days)}\)
\(\text{Maximum reduction time = 2 days}\)
♦♦ Mean mark (c) 35%.
♦♦ Mean mark (d) 33%.
♦♦ Mean mark (d) 33%.
e.
\begin{array} {|c|c|}
\hline
\quad\textbf{Activity} \quad & \textbf{Reduction in completion time} \\
& \textbf{(0, 1 or 2 days)}\\
\hline
\rule{0pt}{2.5ex} A \rule[-1ex]{0pt}{0pt} & 2\\
\hline
\rule{0pt}{2.5ex} B \rule[-1ex]{0pt}{0pt} & 2\\
\hline
\rule{0pt}{2.5ex} F \rule[-1ex]{0pt}{0pt} & 0\\
\hline
\rule{0pt}{2.5ex} H \rule[-1ex]{0pt}{0pt} & 2\\
\hline
\rule{0pt}{2.5ex} I \rule[-1ex]{0pt}{0pt} & 2\\
\hline
\rule{0pt}{2.5ex} K \rule[-1ex]{0pt}{0pt} & 1\\
\hline
\end{array}
♦♦♦ Mean mark (e) 9%.
Networks, GEN1 2022 VCAA 6 MC
A landscaping project has 12 activities. The network below gives the time, in hours, that it takes to complete each activity.
The earliest start time, in hours, for activity \(G\) is
- 10
- 11
- 12
- 13
- 14
NETWORKS, FUR2 2021 VCAA 4
Roadworks planned by the local council require 13 activities to be completed.
The network below shows these 13 activities and their completion times in weeks.
- What is the earliest start time, in weeks, of activity `K`? (1 mark)
- How many of these activities have zero float time? (1 mark)
- It is possible to reduce the completion time for activities `A, E, F, L` and `K`.
- The reduction in completion time for each of these five activities will incur an additional cost.
- The table below shows the five activities that can have their completion time reduced and the associated weekly cost, in dollars.
- The completion time for each these five activities can be reduced by a maximum of two weeks.
- The overall completion time for the roadworks can be reduced to 16 weeks.
- What is the minimum cost, in dollars, of this change in completion time? (1 mark)
Show Worked Solution
a. `text{Scan forwards:}`
`EST \ (text{activity} \ K)`
`= A \ E \ J`
`= 6 + 5 + 3`
`= 14 \ text{weeks}`
b. `text{Scan backwards:}`
`text{Critical paths:}\ ADGLM\ text(and)\ AEHLM`
`:. \ text{7 activities have no float time:} \ ADEGHLM`
c. `text{There are 9 possible paths}`
`ADGLM\ (19), AEHLM\ (19) , AEIM\ (14)`
`AEJK\ (17), BCEIM \ (13), BCEJK\ (16)`
`BCEHLM\ (18), BCDGLM \ (18), BFK (11)`
`text{Consider the 5 paths with completions over 16 weeks}`
` to \ text{all contain}\ A\ text{or}\ L \ text{or both.}`
`text{Consider} \ ADGLM, AEHLM \ (text{contains both} \ A\ text{and} \ L )`
`to \ text{reduce} \ L xx 2 \ , A xx 1 \ text{to reach 16 weeks}`
`to \ text{cheaper than} \ L xx 1 \ , \ A xx 2`
`text{Consider} \ BCEHLM , BCDGLM\ (text{both contain} \ L \ text{only})`
`to \ text{reduce} \ L xx 2 \ text{to reach 16 weeks}`
`text{Consider} \ AEJK \ ( text{contains} \ A \ text{only} )`
`to \ text{reduce} \ A xx 1 \ text{reach 16 weeks}.`
`:. \ text{Minimum cost to reduce time to 16 weeks}`
`= 2 xx 120\ 000 + 1 xx 140\ 000`
`= $ 380\ 000`
NETWORKS, FUR1 2021 VCAA 6 MC
The directed graph below shows the sequence of activities required to complete a project.
The time taken to complete each activity, in hours, is also shown.
The minimum completion time for this project is 18 hours.
The time taken to complete activity `E` is labelled `x`.
The maximum value of `x` is
- 2
- 3
- 4
- 5
- 6
NETWORKS, FUR1 2020 VCAA 10 MC
The directed network below shows the sequence of activities, `A` to `I`, that is required to complete an office renovation.
The time taken to complete each activity, in weeks, is also shown.
The project manager would like to complete the office renovation in less time.
The project manager asks all the workers assigned to activity `H` to also work on activity `F`.
This will reduce the completion time of activity `F` to three weeks.
The workers assigned to activity `H` cannot work on both activity `H` and activity `F` at the same time.
No other activity times will be changed.
This change to the network will result in a change to the completion time of the office renovation.
Which one of the following is correct?
- The completion time will be reduced by one week if activity `F` is completed before activity `H` is started.
- The completion time will be reduced by three weeks if activity `F` is completed before activity `H` is started.
- The completion time will be reduced by one week if activity `H` is completed before activity `F` is started.
- The completion time will be reduced by three weeks if activity `H` is completed before activity `F` is started.
- The completion time will be increased by three weeks if activity `H` is completed before activity `F` is started.
Show Worked Solution
`text{Original forward scan (note}\ F\ text{is 6 origionally but}`
♦♦♦ Mean mark 24%.
`text{is reduced to 3 for the adjusted critical path):}`
`text(Original critical path is:)\ ACEFGI = 2+5+3+6+4+5=25`
`text(If activity)\ F\ text(is completed in 3 weeks, and then)`
`text(activity)\ H\ text(starts, new critical path is:)`
`ACEF\ text{(dummy)}\ HI = 24\ text(weeks)`
`=> A`
NETWORKS, FUR1 2020 VCAA 6 MC
The activity network below shows the sequence of activities required to complete a project.
The number next to each activity in the network is the time it takes to complete that activity, in days.
The minimum completion time for this project, in days, is
- 18
- 19
- 20
- 21
- 22
Show Worked Solution
`text(Scanning forward:)`
| `text(Critical path)` | `= BEIJM` |
| `= 7 + 4 + 3 + 3 + 5` | |
| `= 22\ text(days)` |
`=> E`
NETWORKS, FUR1 2018 VCAA 7 MC
A project requires nine activities (A–I) to be completed. The duration, in hours, and the immediate predecessor(s) of each activity are shown in the table below.
The minimum completion time for this project, in hours, is
- 14
- 19
- 20
- 24
- 35
Show Worked Solution
`text(Sketch the network:)`
`text(Completion time of paths:)`♦ Mean mark 49%.
`ABEGI = 4 + 3 + 5 + 4 + 3 = 19\ text(hours)`
`ACFGI = 4 + 7 + 2 + 4 + 3 = 20\ text(hours)`
`ADHI = 4 + 2 + 5 + 3 = 14\ text(hours)`
`:.\ text{Minimum completion time (critical path) = 20 hours}`
`=> C`
NETWORKS, FUR1 2018 VCAA 5 MC
The directed network below shows the sequence of 11 activities that are needed to complete a project.
The time, in weeks, that it takes to complete each activity is also shown.
How many of these activities could be delayed without affecting the minimum completion time of the project?
- 3
- 4
- 5
- 6
- 7
NETWORKS, FUR2 2018 VCAA 3
At the Zenith Post Office all computer systems are to be upgraded.
This project involves 10 activities, `A` to `J`.
The directed network below shows these activities and their completion times, in hours.
- Determine the earliest starting time, in hours, for activity `I`. (1 mark)
- The minimum completion time for the project is 15 hours.
Write down the critical path. (1 mark)
- Two of the activities have a float time of two hours.
Write down these two activities. (1 mark)
- For the next upgrade, the same project will be repeated but one extra activity will be added.
This activity has a duration of one hour, an earliest starting time of five hours and a latest starting time of 12 hours.Complete the following sentence by filling in the boxes provided. (1 mark)
The extra activity could be represented on the network above by a directed edge from the
| end of activity |
|
to the start of activity |
|
Show Worked Solution
a. `text(Longest path to)\ I:`
`B -> E -> G`
| `:.\ text(EST for)\ \ I` | `= 2 + 3 + 5` |
| `= 10\ text(hours)` |
b. `B – E – G – H – J`
c. `text(Scanning forwards and backwards:)`♦ Mean mark 45%.
`:.\ text(Activity)\ A\ text(and)\ C\ text(have a 2 hour float time.)`
d. `text(end of activity)\ E\ text(to the start of activity)\ J`♦♦ Mean mark 25%.
`text(By inspection of forward and backward scanning:)`
`text(EST of 5 hours is possible after activity)\ E.`
`text(LST of 12 hours after activity)\ E -> text(edge has weight)`
`text(of 1 and connects to)\ J`
NETWORKS, FUR1 2017 VCAA 4-5 MC
The directed graph below shows the sequence of activities required to complete a project.
The time to complete each activity, in hours, is also shown.
Part 1
The earliest starting time, in hours, for activity `N` is
- 3
- 10
- 11
- 12
- 13
Part 2
To complete the project in minimum time, some activities cannot be delayed.
The number of activities that cannot be delayed is
- 2
- 3
- 4
- 5
- 6
NETWORKS, FUR2 2016 VCAA 3
A new skateboard park is to be built in Beachton.
This project involves 13 activities, `A` to `M`.
The directed network below shows these activities and their completion times in days.
- Determine the earliest start time for activity `M`. (1 mark)
- The minimum completion time for the skateboard park is 15 days.
Write down the critical path for this project. (1 mark)
- Which activity has a float time of two days? (1 mark)
- The completion times for activities `E, F, G, I` and `J` can each be reduced by one day.
The cost of reducing the completion time by one day for these activities is shown in the table below.
What is the minimum cost to complete the project in the shortest time possible? (1 mark)
- The original skateboard park project from part (a), before the reduction of time in any activity, will be repeated at another town named Campville, but with the addition of one extra activity.
The new activity, `N`, will take six days to complete and has a float time of one day.
Activity `N` will finish at the same time as the project.
- Add activity `N` to the network below. (1 mark)
- What is the latest start time for activity `N`? (1 mark)
- Add activity `N` to the network below. (1 mark)
Show Answers Only
Show Worked Solution
| a. | `text(EST)` | `= 1 + 4 + 6` |
| `= 11\ text(days)` |
b. `text(Critical Path:)\ AEIK`
♦♦ Mean mark part (c) 37%, part (d) 21%.
MARKER’S COMMENT: In part (d), `ADK` cannot be crashed, therefore shortest duration is 14 days. Activity `I` is cheapest to reduce.
MARKER’S COMMENT: In part (d), `ADK` cannot be crashed, therefore shortest duration is 14 days. Activity `I` is cheapest to reduce.
c. `text(Activity)\ H`
d. `text(Minimum days to complete is 14 days by reducing)`
`text(either)\ E\ text(or)\ I\ text(by 1 day.)`
`:. text(Minimum cost of $2000 when activity)\ I\ text(is reduced)`
`text(by 1 day.)`
| e.i. |
|
♦♦ Mean mark part (e)(i) 21%, (e)(ii) 27%.
MARKER’S COMMENT: In (e)(ii), activity `N` must have an arrow on it.
MARKER’S COMMENT: In (e)(ii), activity `N` must have an arrow on it.
| e.ii. | `text(LST)` | `=\ text(critical path time − 6 days)` |
| `= 15 – 6` | ||
| `= 9\ text(days from the start.)` |
NETWORKS, FUR1 2016 VCAA 6-7 MC
The directed graph below shows the sequence of activities required to complete a project.
All times are in hours.
Part 1
The number of activities that have exactly two immediate predecessors is
- 0
- 1
- 2
- 3
- 4
Part 2
There is one critical path for this project.
Three critical paths would exist if the duration of activity
- I were reduced by two hours.
- E were reduced by one hour.
- G were increased by six hours.
- K were increased by two hours.
- F were increased by two hours.
NETWORKS, FUR1 2008 VCAA 8-9 MC
The network below shows the activities that are needed to finish a particular project and their completion times (in days).
Part 1
The earliest start time for Activity `K`, in days, is
A. 7
B. 15
C. 16
D. 19
E. 20
Part 2
This project currently has one critical path.
A second critical path, in addition to the first, would be created by
A. increasing the completion time of `D` by 7 days.
B. increasing the completion time of `G` by 1 day.
C. increasing the completion time of `I` by 2 days.
D. decreasing the completion time of `C` by 1 day.
E. decreasing the completion time of `H` by 2 days.
NETWORKS, FUR1 2010 VCAA 8 MC
A project has 12 activities. The network below gives the time (in hours) that it takes to complete each activity.
The critical path for this project is
A. `ADGK`
B. `ADGIL`
C. `BHJL`
D. `CEGIL`
E. `CEHJL`
NETWORKS, FUR1 2006 VCAA 9 MC
The network below shows the activities and their completion times (in hours) that are needed to complete a project.
The project is to be crashed by reducing the completion time of one activity only.
This will reduce the completion time of the project by a maximum of
A. 1 hour
B. 2 hours
C. 3 hours
D. 4 hours
E. 5 hours
NETWORKS, FUR1 2007 VCAA 5-6 MC
The following network shows the activities that are needed to complete a project and their completion times (in hours).
Part 1
Which one of the following statements regarding this project is false?
A. Activities `A, B` and `C` all have the same earliest start time.
B. There is only one critical path for this project.
C. Activity `J` may start later than activity `H.`
D. The shortest path gives the minimum time for project completion.
E. Activity `L` must be on the critical path.
Part 2
The earliest start time for activity `L`, in hours, is
A. 11
B. 12
C. 14
D. 15
E. 16
NETWORKS, FUR1 2011 VCAA 8 MC
The diagram shows the tasks that must be completed in a project.
Also shown are the completion times, in minutes, for each task.
The critical path for this project includes activities
A. `B and I.`
B. `C and H.`
C. `D and E.`
D. `F and K.`
E. `G and J.`
NETWORKS, FUR1 2012 VCAA 9 MC
John, Ken and Lisa must work together to complete eight activities, `A, B, C, D, E, F, G` and `H`, in minimum time.
The directed network below shows the activities, their completion times in days, and the order in which they must be completed.
Several activities need special skills. Each of these activities may be completed only by a specified person.
- Activities `A` and `F` may only be completed by John.
- Activities `B` and `C` may only be completed by Ken.
- Activities `D` and `E` may only be completed by Lisa.
- Activities `G` and `H` may be completed by any one of John, Ken or Lisa.
With these conditions, the minimum number of days required to complete these eight activities is
A. 14
B. 17
C. 20
D. 21
E. 24
NETWORKS, FUR2 2007 VCAA 4
A community centre is to be built on the new housing estate.
Nine activities have been identified for this building project.
The directed network below shows the activities and their completion times in weeks.
- Determine the minimum time, in weeks, to complete this project. (1 mark)
- Determine the slack time, in weeks, for activity `D`. (2 marks)
The builders of the community centre are able to speed up the project.
Some of the activities can be reduced in time at an additional cost.
The activities that can be reduced in time are `A`, `C`, `E`, `F` and `G`.
- Which of these activities, if reduced in time individually, would not result in an earlier completion of the project? (1 mark)
The owner of the estate is prepared to pay the additional cost to achieve early completion.
The cost of reducing the time of each activity is $5000 per week.
The maximum reduction in time for each one of the five activities, `A`, `C`, `E`, `F`, `G`, is 2 weeks.
- Determine the minimum time, in weeks, for the project to be completed now that certain activities can be reduced in time. (1 mark)
- Determine the minimum additional cost of completing the project in this reduced time. (1 mark)
NETWORKS, FUR1 2014 VCAA 8 MC
Which one of the following statements about critical paths is true?
- There can be only one critical path in a project.
- A critical path always includes at least two activities.
- A critical path will always include the activity that takes the longest time to complete.
- Reducing the time of any activity on a critical path for a project will always reduce the minimum completion time for the project.
- If there are no other changes, increasing the time of any activity on a critical path will always increase the completion time of a project.
NETWORKS, FUR2 2009 VCAA 4
A walkway is to be built across the lake.
Eleven activities must be completed for this building project.
The directed network below shows the activities and their completion times in weeks.
- What is the earliest start time for activity `E`? (1 mark)
- Write down the critical path for this project. (1 mark)
- The project supervisor correctly writes down the float time for each activity that can be delayed and makes a list of these times.
Determine the longest float time, in weeks, on the supervisor’s list. (1 mark)
A twelfth activity, `L`, with duration three weeks, is to be added without altering the critical path.
Activity `L` has an earliest start time of four weeks and a latest start time of five weeks.
- Draw in activity `L` on the network diagram above. (1 mark)
- Activity `L` starts, but then takes four weeks longer than originally planned.
Determine the total overall time, in weeks, for the completion of this building project. (1 mark)
Show Answers Only
- `7`
- `BDFGIK`
- `H\ text(or)\ J\ text(can be delayed for)`
`text(a maximum of 3 weeks.)` -
- `text(25 weeks)`
Show Worked Solution
a. `7\ text(weeks)`
♦ Mean mark of all parts (combined): 44%.
b. `BDFGIK`
c. `H\ text(or)\ J\ text(can be delayed for a maximum)`
`text(of 3 weeks.)`
| d. |  |
e. `text(The new critical path is)\ BLEGIK.`
`L\ text(now takes 7 weeks.)`
`:.\ text(Time for completion)`
`= 4 + 7 + 1 + 5 + 2 + 6`
`= 25\ text(weeks)`
NETWORKS, FUR2 2010 VCAA 4
In the final challenge, each of four teams has to complete a construction project that involves activities `A` to `I`.
Table 1 shows the earliest start time (EST), latest start time (LST) and duration, in minutes, for each activity.
The immediate predecessor is also shown. The earliest start time for activity `F` is missing.
- What is the least number of activities that must be completed before activity `F` can commence? (1 mark)
- What is the earliest start time for activity `F`? (1 mark)
- Write down all the activities that must be completed before activity `G` can commence. (1 mark)
- What is the float time, in minutes, for activity `G`? (1 mark)
- What is the shortest time, in minutes, in which this construction project can be completed? (1 mark)
- Write down the critical path for this network. (1 mark)
NETWORKS, FUR2 2011 VCAA 3
A section of the Farnham showgrounds has flooded due to a broken water pipe. The public will be stopped from entering the flooded area until repairs are made and the area has been cleaned up.
The table below shows the nine activities that need to be completed in order to repair the water pipe. Also shown are some of the durations, Earliest Start Times (EST) and the immediate predecessors for the activities.
- What is the duration of activity `B`? (1 mark)
- What is the Earliest Start Time (EST) for activity `D`? (1 mark)
- Once the water has been turned off (Activity `B`), which of the activities `C` to `I` could be delayed without affecting the shortest time to complete all activities? (1 mark)
It is more complicated to replace the broken water pipe (Activity `E`) than expected. It will now take four hours to complete instead of two hours.
- Determine the shortest time in which activities `A` to `I` can now be completed. (1 mark)
Turning on the water to the showgrounds (Activity `H`) will also take more time than originally expected. It will now take five hours to complete instead of one hour.
- With the increased duration of Activity `H` and Activity `E`, determine the shortest time in which activities `A` to `I` can be completed. (1 mark)
NETWORKS, FUR2 2012 VCAA 2
Thirteen activities must be completed before the produce grown on a farm can be harvested.
The directed network below shows these activities and their completion times in days.
- Determine the earliest starting time, in days, for activity `E`. (1 mark)
- A dummy activity starts at the end of activity `B`.
Explain why this dummy activity is used on the network diagram. (1 mark)
- Determine the earliest starting time, in days, for activity `H`. (1 mark)
- In order, list the activities on the critical path. (1 mark)
- Determine the latest starting time, in days, for activity `J`. (1 mark)