Activity charts and network diagrams
Reading an activity chart (precedence table), immediate predecessors, drawing an activity-on-arc network, and using a dummy activity when two activities share some but not all of their predecessors.
A project is a set of activities (jobs) that take time. Some can happen at the same time; others have to wait. Before you can work out how long the project takes, you need a picture that shows exactly which jobs wait for which. That picture is a project network.
Activity charts
An activity chart (also called a precedence table) lists each activity, its duration, and its immediate predecessors: the activities that must be finished just before it can start. "Immediate" matters. If filming needs rehearsals, and rehearsals need casting, then casting is a predecessor of filming, but not an immediate one. The chart only lists the last link in the chain.
| Activity | Task (school video) | Days | Immediate predecessors |
|---|---|---|---|
| A | Write the script | $3$ | – |
| B | Cast the actors | $2$ | A |
| C | Book locations | $1$ | A |
| D | Rehearse | $2$ | B |
| E | Film | $4$ | C, D |
Drawing the network
In HSC networks, each activity is an arc (an arrow) labelled with its letter and duration. Each node (circle) is an event: the moment the activities coming into it are all finished, so the activities leaving it can start. There is one start node and one finish node.
Draw the network for the school video chart above.
You can also go the other way. To read the immediate predecessors of an activity from a network, look at the node its arrow leaves from, and list every activity whose arrow ends at that node (following any dummy back to where it started).
Dummy activities
Sometimes the chart is impossible to draw with real activities alone. A dummy activity fixes that. It is drawn as a dashed arrow, takes zero time and does no work. It only carries the message "this activity has finished" from one node to another.
You need a dummy when two activities share some, but not all, of their immediate predecessors. Try it below: S needs P and Q, but R needs only P.
Step through the build one activity at a time. At step 5, before you read the explanation, decide where S should start. Why can't it start at node 2? Why can't it start at node 3 without the dummy?
Cover the network and redraw it yourself from the table, then step through to check.
A café is opening in Newtown. Draw the network.
| Activity | Task | Days | Immediate predecessors |
|---|---|---|---|
| K | Sign the lease | $2$ | – |
| L | Hire staff | $5$ | – |
| M | Fit out the kitchen | $6$ | K |
| N | Train staff on site | $3$ | K, L |
Your turn
A network has these arcs: A from node 1 to 2, B from node 1 to 3, C from node 2 to 3, D from node 3 to 4, E from node 2 to 4. Write the immediate predecessors of C, D and E.
Show the answer
C leaves node 2, where only A arrives: C needs A. D leaves node 3, where B and C arrive: D needs B and C. E leaves node 2: E needs A.
In the project networks used in this course, each activity is shown as:
Activities are on the arcs, labelled with their letter and duration. Nodes mark the moments when activities finish and the next ones can start.
Painting needs plastering, and plastering needs wiring. Which is true?
Plastering must finish just before painting starts, so it is the immediate predecessor. Wiring is earlier in the chain, so it is a predecessor of painting but not an immediate one.
A dummy activity is needed when:
The dummy lets one activity wait for an extra predecessor without making the other activity wait as well.
How many days does a dummy activity take?
A dummy does no work. It only shows that one event must happen before another, so its duration is $0$.
An activity chart has A (no predecessors), B (no predecessors), C (after A) and D (after B). How many arcs leave the start node?
Only activities with no predecessors leave the start node: A and B. That is $2$ arcs.
A network has arcs A from node 1 to 2, B from node 1 to 3, C from node 2 to 3, D from node 3 to 4 and E from node 2 to 4. The immediate predecessors of D are:
D leaves node 3. The arcs arriving at node 3 are B and C, so D needs both.
For the same network, the immediate predecessor of E is:
E leaves node 2, and only A arrives at node 2.
Exam style: An activity chart has J (–), K (–), L (after J) and M (after J and K). Where should the dummy go?
L and M share J, but M also needs K. L leaves the end of J. A dummy from the end of J to the end of K makes that node mean "J and K are done", and M leaves from there. A dummy the other way would make L wait for K.
Exam style: A network has A from node 1 to 2, B from node 1 to 3, a dummy from node 2 to 3, C from node 2 to 4 and D from node 3 to 4. Which activities must be finished before D can start?
D leaves node 3. B arrives at node 3 directly, and A arrives through the dummy from node 2. So D needs A and B.
Coaching Centre