Activity networks and precedence tables
Studying this course? Keep your progress in one place.
Key facts
- In an activity on arc network, each activity is an arc and each event is a node.
- A precedence table lists the immediate predecessors of each activity.
- A dummy activity has zero duration and shows a dependency, or gives each activity a unique pair of events.
- To read predecessors from a network, look at the start event and trace back through any dummies.
- The network has one start event, one finish event and no cycles.
Activity networks
In an activity on arc network, arcs are activities with durations and nodes are events, with one start event and one finish event.
Critical path analysis models a project as an activity network. In the activity on arc form each activity is an arc labelled with its letter and duration, and each event is a node, usually numbered.
An event is reached only when every activity ending there is complete, and only then can activities starting there begin.
There is one start event and one finish event, and no cycles.
In an activity on arc network, what does a node represent?
Precedence tables
It lists each activity with its immediate predecessors: the activities that must finish before it can start.
A precedence table lists each activity with its immediate predecessors: those that must finish before it can start, with no other activity between them. Only immediate predecessors are shown.
Activities with no predecessors start at the start event. An activity that is not a predecessor of any other ends at the finish event.
| Immediate predecessors | Starts at event | |
|---|---|---|
| A | none | 1 |
| B | none | 1 |
| C | A, B | 2 |
| D | B | 3 |
Immediate predecessors
- A:
- none
- B:
- none
- C:
- A, B
- D:
- B
Starts at event
- A:
- 1
- B:
- 1
- C:
- 2
- D:
- 3
Worked example
depends on , and depends on . What is the immediate predecessor of ?
- 1
must finish before can start.
- 2
must also finish, but only because cannot start until finishes.
- 3
is implied by , so it is not listed.
An activity is not a predecessor of any other activity. Where does it end?
Dummy activities
A dummy is a dotted arc of zero duration that shows a dependency or makes each activity's pair of events unique.
A dummy activity is an arc of zero duration, drawn dotted, that uses no resources. It has two uses.
- Logic: to show a dependency without making another activity depend on it.
- Unique identification: if two activities share the same start and end events, one ends at its own event and is joined to the shared event by a dummy.
A dummy shows only that one event must be reached before another. Do not add dummies that are not needed.
| Logic | Unique identification | |
|---|---|---|
| Used to | Shows one dependency | Two activities share both events |
| Result | Other activities stay independent | One gets its own end event |
Logic
- Used to:
- Shows one dependency
- Result:
- Other activities stay independent
Unique identification
- Used to:
- Two activities share both events
- Result:
- One gets its own end event
Worked example
depends on and , but depends only on . How is this drawn?
- 1
ends at an event where starts.
- 2
ends at a separate event, where starts.
- 3
A dummy runs from the end of to the start of , so waits for both.
How long does a dummy activity take?
Drawing from a table
Start with activities that have no predecessors, join each activity at an event where all its predecessors end, then use dummies where needed.
- Draw activities with no predecessors from the start event.
- An activity with one predecessor starts where that predecessor ends.
- An activity with several predecessors starts at one event where all of them end, using dummies where needed.
- Activities that share all their predecessors start at the same event.
- Join all activities with no successors to one finish event, then number the events.
Read the table back from your network to check it.
Worked example
has no predecessor, has no predecessor, depends on and , depends on . Draw the network.
- 1
and both start at the start event.
- 2
ends at the event where starts.
- 3
ends at the event where starts.
- 4
also needs , so a dummy runs from the end of to the start of .
- 5
Without the dummy, would wrongly depend on .
Two activities have exactly the same predecessors. Where do they start?
Table from a network
Look at an activity's start event. Predecessors are the activities ending there, plus those ending at the start of any dummy arriving there.
To find the immediate predecessors of an activity, look at its start event. They are the activities that end at that event, plus, for each dummy ending there, the activities that end at the start of the dummy.
Never list a dummy as a predecessor. If the dummy comes from an event where several activities end, all of them are predecessors.
- 1
Find the start event
D starts at event 3
- 2
Activities ending there
B ends at event 3
- 3
Dummies arriving
a dummy comes from event 2, where A ends
- 4
List real activities
A and B
Worked example
starts at event 3, where ends and a dummy from event 2 arrives. ends at event 2. What are the immediate predecessors of ?
- 1
ends at event 3, so is a predecessor.
- 2
The dummy arrives from event 2, where ends, so is a predecessor.
- 3
Do not list the dummy itself.
A dummy comes from an event where and both end. What does this tell you about the activity starting after the dummy?
Try an exam question
Activity depends only on . Activity depends on and . Explain how a dummy activity is used to show this in an activity on arc network, and state its duration.
[4 marks]
- [1] ends at an event, and starts at that event.
- [1] ends at a different event, so that does not depend on .
- [1]A dummy runs from the event where ends to the event where ends, from which starts, so waits for both.
- [1]The dummy has zero duration and uses no resources.
That's the notes covered.
Carry on to the next subtopic.
Try a question
What is the minimum number of dummy activities needed?
1 mark, marked against the mark scheme
What is the minimum number of dummy activities needed?
1 mark, marked against the mark scheme