Understand the idea.
Four times for each activity
For an activity from event to event , use the tail's earliest time for and add the duration for . Use the head's latest time for and subtract the duration for . Keep these four labels distinct.
The activity's earliest finish need not equal the head event's earliest time. Another incoming activity may finish later and hold up the event, even though this particular activity has already finished.
| Event | Earliest time | Latest time |
|---|---|---|
| 1 | 0 | 0 |
| 2 | 4 | 4 |
| 3 | 3 | 8 |
| 4 | 8 | 8 |
| 5 | 10 | 10 |
| 6 | 13 | 13 |
Read a time window
For B, , , and . Its possible start window is day 0 through day 5 if the day-13 project finish is protected and the remaining work is scheduled consistently.
For C, starting at day 4 gives , while the merge event waits until day 10 for E. Describe a window as actual start and finish times, and retain the model's assumptions about reliable durations and sufficient parallel resources.
See the method in action.
Use event values
An activity takes 6 hours. Its tail has earliest time 3 and its head has latest time 14. Find ES, EF, LS and LF.
Worked solution
- 1
Use the tail event for earliest start.
The activity can start as soon as its tail event occurs.
- 2
Calculate its earliest finish.
Finishing requires its full six-hour duration after starting.
- 3
Use the head event for latest finish.
The activity must be complete by the latest permitted occurrence of its head event.
- 4
Work backwards to latest start.
Starting at hour 8 leaves exactly six hours before the latest finish.
ES=3, EF=9, LS=8, LF=14 hours.
Do not copy the head's earliest time
Activities P and Q finish at the same event. P starts at 2 and lasts 4 hours; Q starts at 5 and lasts 3 hours. Find P's earliest finish and the event's earliest time.
Worked solution
- 1
Calculate P's own finish.
P's finish uses P's start and duration, independently of Q.
- 2
Calculate Q's finish.
Q reaches the shared event two hours later than P.
- 3
Find the shared event time.
The event must wait for Q even though P has already finished at hour 6.
P has EF=6 hours; the event occurs at 8 hours.
Try it yourself.
Check your understanding
An activity has ES=7, duration=4 and LF=13. What is its latest start?
Show answer & reasoning
9.
Use the latest finish, not the earliest start: . A start at time 9 completes the activity exactly at its latest finish of 13.
Keep practising
6 worksheet questions · 15 marks
Read the questions online
- Use the display project to find , , and for B.3 marks
Forward and backward scans for the display network, with completion at day 13. Event Earliest time Latest time 1 0 0 2 4 4 3 3 8 4 8 8 5 10 10 6 13 13 - Find all four activity times for C in the display project.3 marks
Forward and backward scans for the display network, with completion at day 13. Event Earliest time Latest time 1 0 0 2 4 4 3 3 8 4 8 8 5 10 10 6 13 13 - Find all four times for E in the display project.2 marks
Forward and backward scans for the display network, with completion at day 13. Event Earliest time Latest time 1 0 0 2 4 4 3 3 8 4 8 8 5 10 10 6 13 13 - A task lasts 8 minutes. Its is 12 and is 15. Find and .2 marks
- An activity runs 2→5 for 3 days. , and . Find its earliest finish and explain why it differs from .3 marks
- A claimed schedule gives , , and for one fixed-duration activity. Identify the inconsistency.2 marks
Read the worked solutions
Equivalent correct methods earn the corresponding marks. Include units where asked.
- Use the display project to find , , and for B.3 marks
Forward and backward scans for the display network, with completion at day 13. Event Earliest time Latest time 1 0 0 2 4 4 3 3 8 4 8 8 5 10 10 6 13 13 B is 1→3 of duration 3.
; ; ; .
0, 3, 5 and 8 days respectively. - Find all four activity times for C in the display project.3 marks
Forward and backward scans for the display network, with completion at day 13. Event Earliest time Latest time 1 0 0 2 4 4 3 3 8 4 8 8 5 10 10 6 13 13 C is 2→5 of duration 5.
; ; ; .
, , , days. - Find all four times for E in the display project.2 marks
Forward and backward scans for the display network, with completion at day 13. Event Earliest time Latest time 1 0 0 2 4 4 3 3 8 4 8 8 5 10 10 6 13 13 E is 4→5 of duration 2.
Use and .
, , , days. - A task lasts 8 minutes. Its is 12 and is 15. Find and .2 marks
Add the same fixed duration to each start.
; .
and minutes. - An activity runs 2→5 for 3 days. , and . Find its earliest finish and explain why it differs from .3 marks
The task itself finishes at .
An event combines all incoming requirements.
days; event 5 waits for another incoming activity until day 12. - A claimed schedule gives , , and for one fixed-duration activity. Identify the inconsistency.2 marks
.
; the same activity cannot have both durations in this model.
The duration would be 6 from / but 5 from /.
Curriculum reference & lesson scope
SACE Board of South Australia
Stage 2 General Mathematics: discrete models, project scheduling and assignment. Activity-on-arrow conventions are used for project networks; technology may verify calculations but does not replace interpreting the model.
Official curriculum source ↗