Activity networks Example 2

The table below shows the tasks involved in a project, with their durations and immediate predecessors.
Task A Duration (days) 2 Immediate predecessors -

B
C D E F G

3
5 6 8 2 4

A, B C C D, E

Draw an activity network and use it to find the critical activities and the minimum duration of the project.

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.

Activity networks Example 2

2

A(2)
1 3 D(6)

B(3)

C(5)

Activity D depends on both A and B. Since A and B must not start and finish at the same node, a dummy activity is needed to ensure unique numbering.

The dummy activity has zero duration. Now activity D can be drawn in, following on from both A and B.

Activity networks Example 2

2

A(2)
1 3 D(6)

B(3)

C(5) E(8) 4

Activities E and F both depend on activity C.

F(2)

Activity networks Example 2

2

A(2)
1 3 D(6) 5 G(4)

B(3)

C(5)

E(8) E(8) 4

Since G depends on both D and E, these two activities must both lead into the same node.

F(2)

Activity G can now be drawn in.

Activity networks Example 2

2

A(2)
1 3 D(6) 5 G(4) 6

B(3)

C(5)

E(8) F(2) 4

Finally, activities F and G must finish at the end node.

F(2)

Activity networks Example 2

2

A(2)
1 3 D(6) 5 G(4) 6

B(3)

C(5)

E(8) F(2) 4

The next step is to find the earliest event times (EETs).

Activity networks Example 2

2 2

A(2)
1 0 C(5) E(8) F(2) 4 3 D(6) 5 G(4) 6

B(3)

Event 1 occurs at time zero. The earliest that event 2 can occur is after A has finished, at time 2.

Activity networks Example 2

2 2

A(2)
1 0 C(5) 3 3 E(8) F(2) 4 D(6) 5 G(4) 6

B(3)

Event 3 cannot occur until both A and B have finished, so the earliest time at which event 3 can occur is 3.

Activity networks Example 2

2 2

A(2)
1 0 C(5) 3 3 E(8) F(2) 4 D(6) 5 G(4) 6

B(3)

Event 4 cannot occur until C has finished, so the earliest time at which event 5 can occur is 5.

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 E(8) F(2) 4 3 D(6) 5 G(4) 6

The earliest that D can finish is at time 9, and the earliest that E can finish is at time 13, so the earliest that event 5 can occur is time 13.

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 E(8) F(2) 4 3 D(6) 5 G(4) 6 17

The earliest that F can finish is at time 7, and the earliest that G can finish is at time 17, so the earliest that event 5 can occur is time 17.

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 E(8) F(2) 4 3 D(6) 5 G(4) 6 17

The next step is to find the latest event times (LETs), starting from the finish node and working backwards.

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 E(8) F(2) 4 3 D(6) 5 G(4) 6 17 17

Event 6 must not occur later than time 17, or the project will be delayed .

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 E(8) F(2) 4 3 D(6)

13
5 G(4) 6 17 17

The latest G can start is at time 13, so the latest time for event 5 is 13.

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 E(8) F(2) 4 3 D(6)

13
5 G(4) 6 17 17

The latest that E can start is at time 5, and the latest that F can start is at time 15, so the latest possible time for event 4 is 5.

Activity networks Example 2

2 2

A(2) 13
1 0 C(5) B(3) 3 3 7 E(8) F(2) 4 D(6)

13
5 G(4) 6 17 17

The latest that D can start is at time 7, so the latest possible time for event 3 is 7.

Activity networks Example 2

2 2 7

A(2) 13
1 0 C(5) B(3) 3 3 7 E(8) F(2) 4 D(6)

13
5 G(4) 6 17 17

The latest that the dummy activity (with zero duration) can start is at time 7, so the latest possible time for event 2 is 7.

Activity networks Example 2

2 2 7

A(2) 13
1 0 0 C(5) B(3) 3 3 7 E(8) F(2) 4 D(6)

13
5 G(4) 6 17 17

The latest that event 1 can start is at time 0.

Activity networks Example 2

2 2 7

A(2) 13
1 0 0 C(5) B(3) 3 3 7 E(8) F(2) 4 D(6)

13
5 G(4) 6 17 17

The critical activities are 5 activities for which the float is zero: i.e. the latest event time for activity j the earliest event time for activity i is equal to the activity duration.

Activity networks Example 2

2 2 7

A(2) 13
1 0 0 C(5) B(3) 3 3 7 E(8) F(2) 4 D(6)

13
5 G(4) 6 17 17

The critical activities are C, E and G.

The project can be completed in 17 days.

For analysis of the float in this example, see Example 2 in the Notes and Examples.