Decision Maths

Critical Path Analysis

Problem
Every morning you have three pieces of

bread (A,B and C) under the grill. The grill will take two pieces of bread at a time and will take 30 seconds to toast one side of the bread. How long will it take to toast all three pieces of bread?

Solution
You could follow the Or you could follow a more

schedule below.

efficient plan.

Time
Toast one side of A & B Toast other side of A & B Toast one side of C Toast the other side of C Total Time 30s 30s 30s 30s Total Time 120s Toast one side of A and B Toast one side of C and other of A Toast other side of B and C

Time
30s

30s
30s 90s

Critical Path Analysis

This was a trivial example of how time can be

saved by careful planning. We can apply similar thinking to larger problems involving construction and maintenance. Critical Path Analysis enables us to plan and monitor complex projects, so that they are approached and carried out as efficiently as possible.

Critical Path Analysis

Imagine you have a project to do which

involves doing lots of different activities, some of which cannot be started until others have been completed. For example the stages involved in recording and promoting a compact disc are shown in the table below

Critical Path Analysis

Activity A B C D E F G H I J Tape the performance Design the cover Book adverts in press Tape to CD Produce Cover Packing Promotion Copies to radio Dispatch to shops Played on radio Adverts in press Duration 10 9 3 2 2 1 1 3 2 1 A B D,E D,E F G C,H,I Preceding Activities

Critical Path Analysis

Given the conditions previously shown, what

is the shortest possible time the project can be completed in. We will assume that tasks can be carried out simultaneously whenever the conditions allow it. The first stage is construct a Precedence Network.

Precedence Network
Draw a start node
Duration A B C D E 10 9 3 2 2 A B Prec Act F G H I J Duration 1 1 3 2 1 Prec Act D,E D,E F G C,H,I

From the start node

add the activities that can be done immediately.

A(10) B(9)

1
C(3)

Precedence Network
Activity D needs A to
Duration A B C D 10 9 3 2 A Prec Act F G H I Duration 1 1 3 2 Prec Act D,E D,E F G

have been done immediately before it. Add a node to A. Have D coming from that node.
2 A(10) B(9)

C,H,I

D(2)

1
C(3)

Precedence Network
We can do a similar
Duration A B C D E 10 9 3 2 2 A B Prec Act F G H I J Duration 1 1 3 2 1 Prec Act D,E D,E F G C,H,I

thing with activity E

2 A(10) B(9)

D(2)

1
C(3)

E(2)

Precedence Network
Activities F and G have both
Duration A B C D E 10 9 3 2 2 A B Prec Act F G H I J Duration 1 1 3 2 1 Prec Act D,E D,E F G C,H,I

of D and E as their immediately preceding activities. Bring D and E into a single node. F and G emerge from that node. D(2)
2 A(10) B(9) 4

F(1)

1
C(3)

E(2)

G(1)

Precedence Network
Add nodes to the end of
Duration A B C D E 10 9 3 2 2 A B Prec Act F G H I J Duration 1 1 3 2 1 Prec Act D,E D,E F G C,H,I

activities F and G. Activity H must follow F. Activity I must follow G.

2 A(10) B(9)

D(2)
4

F(1)

H(3)

1
C(3)

E(2)

G(1) 6

I(2)

Precedence Network
J must follow C,H and I,
Duration A B C D E 10 9 3 2 2 A B Prec Act F G H I J Duration 1 1 3 2 1 Prec Act D,E D,E F G C,H,I

so bring all of those in to one node. J can now be added and the network is complete.
2 A(10) B(9)

D(2)
4

F(1)

H(3) J(1)

7
G(1) 6

1
C(3)

E(2)

I(2)

Critical Path Analysis

More Complicated Examples
The example we

have just looked through was a reasonably easy one. Consider the example to the right, it will give us more to think about.

Activity Duration A B C D E 1 2 4 4 3

IPA

A A,B D

Complicated Example 1
Draw a start node

From the start node add

Activity A B C D E

Duration 1 2 4 4 3

IPA

the activities that can be done immediately. Connect nodes to the ends of these activities.
2 A(1) 1 B(2)

A A,B D

Complicated Example 1
Activity C follows A.

D must follow both A

Activity A B C D E

Duration 1 2 4 4 3

IPA

and B. Where should D go?

A A,B D

C(4) 2 A(1) 1 B(2)

Complicated Example 1
You must add in a

dummy activity. This will have a duration of 0. Now to progress from node (3) you will have to have completed A and B. C(4)
2 A(1) 1 B(2) (0)

Activity A B C D E

Duration 1 2 4 4 3

IPA

A A,B D

Why does the dummy go from node (2) to

(3)? Activity C needs to follow A but has no need to follow B. If the dummy went the other way then it would be impossible to place activity C.

Complicated Example 1
Activity D can now be

attached to node (3). Now place a node at the end of D. Activity E can be assigned.
C(4) 2 A(1) 1 B(2) (0) D(4) E(3)

Activity A B C D E 5

Duration 1 2 4 4 3

IPA

A A,B D

Complicated Example 2
This starts in a similar way and

we can assign A and B to node 1. Both C and D must follow A and B, Where does the dummy go? The dummy is set from (3) to (2) because E comes from B and does not follow A.

Activity A B C D E

Duration 1 2 4 4 3

IPA

A,B A,B B

2 A(1)

(0)
1 B(2)

Complicated Example 2
C and D can now be

added to node (2). E can be added to node (3). They all join the final node (4).
C(4) 2 A(1) 1 B(2) (0) D(4) E(3)

Activity A B C D E

Duration 1 2 4 4 3

IPA

A,B A,B B

Complicated Example 3
Activities A and B are

simple. C and E are also simple as they follow A and B respectively. Two dummies are required to a new node (4). D is attached and all meet at (5)
2 A(1) (0)

Activity A B C D E

Duration 1 2 4 4 3

IPA

A A,B B

C(4)
4 (0)

D(4)
5 E(3)

1
B(2) 3

Precedence Network
Below is a precedence Network for a real life construction

project. The times on the arc represent days. What is the quickest time that the project can be completed in? 170 days. 10
3
F(16) B(25) A(10) C(10) D(16) H(18) K(16) O(11) N(34)

I(32)
J(32)

M(31)

G(12)

P(25)

11

T(24) V(21)

14

Q(48) R(16) S(14)

5
E(9)

13
U(50)

L(21)

12

Precedence Network
Due to a resource problem activity H is delayed by 10 days.

What effect will this have on the whole project? The entire project is delayed by 3 days.
10 3
F(16) B(25) A(10) C(10) D(16) H(18) K(16) O(11) N(34)

I(32)
J(32)

M(31)

G(12)

P(25)

11

T(24) V(21)

14

Q(48) R(16) S(14)

5
E(9)

13
U(50)

L(21)

12

Precedence Network
The supervisor in charge of activity I wants to use overtime to

reduce the completion time. How would you respond to this request? No there is plenty of spare time for the activity to be completed.
10 3
F(16) B(25) A(10) C(10) D(16) H(18) K(16) O(11) N(34)

I(32)
J(32)

M(31)

G(12)

P(25)

11

T(24) V(21)

14

Q(48) R(16) S(14)

5
E(9)

13
U(50)

L(21)

12

Precedence Network
Money is available to reduce the time of activity B or Q. Where

would you advise that the money is spent and why? Activity B It can reduce the overall completion time of the project.
10 3
F(16) B(25) A(10) C(10) D(16) H(18) K(16) O(11) N(34)

I(32)
J(32)

M(31)

G(12)

P(25)

11

T(24) V(21)

14

Q(48) R(16) S(14)

5
E(9)

13
U(50)

L(21)

12