Slides in this set

Slide 1

Preview of page 1

Activity networks ­ Example 2
The table below shows the tasks involved in a project,
with their durations and immediate predecessors.
Task Duration (days) Immediate
predecessors
A 2 -
B 3 -
C 5 -
D 6 A, B
E 8 C
F 2 C
G 4 D, E
Draw an activity network and use it to find the critical
activities and the minimum duration of the project.…read more

Slide 2

Preview of page 2

Activity networks ­ Example 2
A(2)
1
B(3)
C(5)
Begin with a start node,
labelled 1.
Activities A, B and C have no
preceding activities, so can
all begin at the start node.…read more

Slide 3

Preview of page 3

Activity networks ­ Example 2
2
A(2)
D(6)
1 3
B(3)
C(5)
Activity D depends on both A The dummy activity has
and B. Since A and B must zero duration. Now
not start and finish at the activity D can be drawn
same node, a dummy activity in, following on from both
is needed to ensure unique A and B.
numbering.…read more

Slide 4

Preview of page 4

Activity networks ­ Example 2
2
A(2)
D(6)
1 3
B(3)
C(5)
E(8)
4
Activities E and F both F(2)
depend on activity C.…read more

Slide 5

Preview of page 5

Activity networks ­ Example 2
2
A(2)
D(6) G(4)
1 3 5
B(3)
C(5) E(8)
E(8)
4
Since G depends on both D F(2) Activity G can now be
and E, these two activities drawn in.
must both lead into the
same node.…read more

Slide 6

Preview of page 6

Activity networks ­ Example 2
2
A(2)
D(6) G(4)
1 3 5 6
B(3)
C(5) E(8)
F(2)
4
Finally, activities F and G F(2)
must finish at the end node.…read more

Slide 7

Preview of page 7
Preview of page 7

Slide 8

Preview of page 8
Preview of page 8

Slide 9

Preview of page 9
Preview of page 9

Slide 10

Preview of page 10
Preview of page 10

Comments

No comments have yet been made

Similar Further Maths resources:

See all Further Maths resources »See all resources »