Activity networks and precedence tables

Activity networks and precedence tables

Spec 4.1–2 · Edexcel International A Level Maths: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • A precedence table lists each activity with its immediate predecessors only.
  • In an activity-on-arc network each arc is an activity and each node is an event, with one start event and one finish event.
  • An activity can start only when every activity arriving at its start event has finished.
  • A dummy activity has zero duration; it shows dependence correctly or gives every activity a unique pair of events.
  • To check a network, list what arrives at each activity's start event: it must equal its table entry.

Precedence tables

A precedence table lists each activity with its immediate predecessors: the activities that must be finished immediately before it can start.

A project is split into activities, each with a duration. Some activities cannot start until others have finished.

A precedence table lists each activity with its immediate predecessors.

Only immediate predecessors are listed. If A must precede C and C must precede F, F's entry is C only, because A is already implied.

An activity with no predecessors is shown with a dash and starts at the start of the project.

ABdummyCD12345
A network for the table: C needs A only; D needs A and B, so a dummy joins the end of A to the start of D.

Immediate predecessors

A:
–
B:
–
C:
A
D:
A, B

Can start when

A:
Project starts
B:
Project starts
C:
A is finished
D:
A and B are finished
C depends on A; D depends on both A and B

A must be done before C, and C must be done before F. What is F's entry in the precedence table?

Activity-on-arc networks

In an activity-on-arc network each arrow is an activity and each node is an event, a point in time when activities start or finish.

In an activity-on-arc network each arc is an activity, labelled with its letter and duration. The nodes are events.

The conventions are:

  • one start event and one finish event only
  • every arrow points forward, with events numbered from low to high
  • an activity starts only when every activity arriving at its start event has finished
  • no two activities share both start and finish events, and there are no loops.
AB1 start23 finish
Each arrow is an activity (with its duration beside it); each numbered node is an event. Arrows point forward from the start event to the finish event.
  • Arc (arrow)an activity, with its duration
  • Nodean event: activities start or finish

Which of these breaks the conventions of an activity-on-arc network?

Drawing a network

Draw the start event, then work down the table giving each activity a start event where all its predecessors finish, using dummies when needed.

Work through the table in order, then check every precedence relationship against the finished network and number the events.

An activity with several predecessors must start at an event where all of them finish. This sometimes needs dummies.

Activities which nothing depends on all finish at the single finish event.

  1. 1

    Start event

    every activity with no predecessor starts here

  2. 2

    Single predecessor

    start where that predecessor finishes

  3. 3

    Several predecessors

    start where all of them finish, adding dummies if needed

  4. 4

    Finish event

    activities nothing depends on end here

  5. 5

    Check

    test every precedence and number the events

Drawing a network

Worked example

Draw the start of the network for: A and B have no predecessors; C depends on A; D depends on A and B.

D depends on A and B, but C depends only on A. What lets D wait for both while C waits only for A?

Dummy activities

A dummy activity has zero duration and uses no resources. It is drawn as a dotted arrow to show dependence or to give every activity a unique pair of events.

A dummy activity is a dotted or dashed arrow with zero duration.

It has two uses:

  • To show dependence correctly. In the network below, the dummy from 2 to 3 makes D wait for A without making C wait for B.
  • To give unique descriptions: two activities with the same start and finish events would both be "event ii to event jj", so a dummy is added to one.

Use as few dummies as possible. A dummy that does not change the logic is redundant and should be removed.

ABdummyCD1234
Dummy from event 2 to event 3

What is the duration of a dummy activity?

Completing a table from a network

Read each activity's start event and list the activities that arrive there, following dummies back to the events they start from.

To complete a table from a network, read each activity's start event and list the activities that arrive at it.

Follow dummies backwards: an activity starting at an event reached by a dummy also depends on the activities finishing at the dummy's start.

List immediate predecessors only. Dummies themselves do not appear in the table.

ABdummyCD12345
Reading the network: A and B start at event 1, C at event 2 (after A), D at event 3 (after A through the dummy, and B).

Starts at event

A:
1
B:
1
C:
2
D:
3

Predecessors

A:
none
B:
none
C:
A
D:
A, B
Result for the network above

Worked example

A: 1 to 2. B: 1 to 3. C: 2 to 4. Dummy: 2 to 3. D: 3 to 4. Complete the precedence table.

A dummy runs from event 2 (where A finishes) to event 5 (where B finishes). Activity X starts at event 5. What does X depend on?

Try an exam question

A project has these activities and immediate predecessors: A (none), B (none), C (A), D (A and B), E (C and D). Describe how to draw the activity-on-arc network, saying where A and B start, why a dummy is needed and where it goes, and where E starts.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Which activity can start as soon as A has finished, even if B has not yet finished?

1 mark, marked against the mark scheme

Revision notes