Lesson 4: Precedence tables and project networks
Drawing the garden shed network
SkillProject networks
Worked example
Draw an activity-on-arc network for the garden shed project.
| Activity | Duration (days) | Immediate predecessors |
|---|---|---|
| A | 2 | — |
| B | 3 | — |
| C | 2 | A |
| D | 4 | B, C |
| E | 2 | D |
| F | 3 | D |
| G | 2 | F |
| H | 1 | E, G |
Step 1: Start event
Draw event 1. and have no predecessors, so both leave event 1.
Step 2: Activity C
needs only . End at event 2 and draw from event 2.
Step 3: Activity D
needs both and . Bring and together at event 3 and draw from it.
An event is the moment all the arrows into it are finished. Ending and at the same event is how the drawing says " waits for both".
Step 4: Activities E and F
Both need only , so both leave event 4, where ends.
Step 5: Activities G and H
needs : end at event 5 and draw from it. needs and : bring them together at event 6 and draw to the finish, event 7.
Step 6: Check against the table
Each letter appears once. Into each activity's start event come exactly its immediate predecessors: ← , ; ← , ; and so on. ✓
Answer
Events 1 to 7: 1→2, 1→3, 2→3, 3→4, 4→6, 4→5, 5→6, 6→7, each arrow labelled with its letter and duration (as in the lesson's figure).
Try a similar one
A fresh question of the same kind, checked as you answer, with hints and a full solution.
Method
Activities with no predecessors leave the start event.
Each activity leaves the event where all its immediate predecessors end.
Activities with no successors end at the finish event.
Number events so arrows point to larger numbers; check every activity against the table.
Watch out for
Drawing from the end of only, forgetting it must also wait for .
Giving and separate finish events: there is only one finish.