Activity networks and precedence tables

Activity networks and precedence tables

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

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.

ABdummyCD1234
Events 1 to 4 are nodes; activities A to D are arcs.

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.

ABdummyCD1234
Activity network for the table: A and B start at event 1, C needs both A and B, D needs only B, so a dummy joins event 3 to event 2

Immediate predecessors

A:
none
B:
none
C:
A, B
D:
B

Starts at event

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

Worked example

CC depends on BB, and BB depends on AA. What is the immediate predecessor of CC?

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.

  1. Logic: to show a dependency without making another activity depend on it.
  2. 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.

ABdummy123
A and B would share the same start and end events. B is given its own end event 3 and a dummy joins it to event 2, so every activity has a unique pair of events

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

SS depends on PP and QQ, but RR depends only on PP. How is this drawn?

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.

  1. Draw activities with no predecessors from the start event.
  2. An activity with one predecessor starts where that predecessor ends.
  3. An activity with several predecessors starts at one event where all of them end, using dummies where needed.
  4. Activities that share all their predecessors start at the same event.
  5. Join all activities with no successors to one finish event, then number the events.

Read the table back from your network to check it.

ABdummyCD1234
A and B have no predecessors, C needs A and B, D needs B.

Worked example

AA has no predecessor, BB has no predecessor, CC depends on AA and BB, DD depends on BB. Draw the network.

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. 1

    Find the start event

    D starts at event 3

  2. 2

    Activities ending there

    B ends at event 3

  3. 3

    Dummies arriving

    a dummy comes from event 2, where A ends

  4. 4

    List real activities

    A and B

Reading predecessors for D

Worked example

DD starts at event 3, where BB ends and a dummy from event 2 arrives. AA ends at event 2. What are the immediate predecessors of DD?

A dummy comes from an event where XX and YY both end. What does this tell you about the activity starting after the dummy?

Try an exam question

Activity CC depends only on AA. Activity DD depends on AA and BB. Explain how a dummy activity is used to show this in an activity on arc network, and state its duration.

[4 marks]

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

Revision notes