CRITICAL PATH

METHODS
CPM

Suppose Three Friends Plan hunting;

2 Hours
One get the food
Second get the hunting gear 3 Hours
Third Get the jeep ready
4 Hours
Then All three Go Hunting 4 Hours

A-

DUMMY
D1

2h

B-3 h

C -4

D-4h

DUMMY
D- 2h

Activity A
Activity B
Activity C
Activity D

DUMMY
E

2
A-

Earliest Project
Finish Time
2 3 4

B-3

D-4

C -4

DUMMY
F

Latest Project
Finish Time

4
Activity

Duration EST

EFT

LST LFT

Activity

Duratio
n

EST

EFT
(EST+
Duration

LST
(LFTDuration)

LFT

Activi Durat
ty
ion

EST EFT

LST

LFT

Total Float
(TF)
(LST-EST
or LFTEFT

Free Float

Independe
nt Float

EARLY BAR CHART

LATE BAR CHART

Find TE & TL
H
t=4

5
L

C
t=

F
t=6

I
E
t=7

J
t=2

t=7

B
t=3

t=6

G
4
t=

t=0

5
t=

K
6
t=

TE & TL
TE =12
TE =5
TL =17

H
t=4

5
TL=21

TE=8

1
TL=0

t=

4
t=

TL=8
TE=8

6
TL=14
I

TL=8 t=7

TE=27

TE=14

F
t=6

t=6

t=0

B
t=3
C

IE =0

t=7

t=
5

TL=21
TL=21

J
t=2

8
TL=27

K
6
t=

EST & LFT

Activit
y
1-2
1-4
1-3
3-4
2-5
4-5
4-6
3-7
5-8
6-8
6-7
7-8

Duratio
n
5
3
8
0
4
4
6
7
6
2
7
6

EST
0
0
0
8
5
8
8
8
12
14
14
21

EFT

LST

LFT
17
8
8
8
21
21
14
21
27
27
21
27

TF

EST, EFT, LST, LFT

Activit
y
1-2
1-4
1-3
3-4
2-5
4-5
4-6
3-7
5-8
6-8
6-7
7-8

Duratio
n
5
3
8
0
4
4
6
7
6
2
7
6

EST

EFT

LST

LFT

0
0
0
8
5
8
8
8
12
14
14
21

5
3
8
8
9
12
14
15
18
16
21
27

12
5
0
8
17
17
8
14
21
25
14
21

17
8
8
8
21
21
14
21
27
27
21
27

TF

SLACK OR FLOAT
Activit
y
1-2
1-4
1-3
3-4
2-5
4-5
4-6
3-7
5-8
6-8
6-7
7-8

Duratio
n
5
3
8
0
4
4
6
7
6
2
7
6

EST

EFT

LST

LFT

0
0
0
8
5
8
8
8
12
14
14
21

5
3
8
8
9
12
14
15
18
16
21
27

12
5
0
8
17
17
8
14
21
25
14
21

17
8
8
8
21
21
14
21
27
27
21
27

TF
12
5
0
0
12
9
0
6
9
11
0
0

Free float represents the amount of time that a schedule activity can be delayed without
delaying the early start date of any immediate successor activity within the network path.

Critical Path
H
t=4

t=
5

TL=0

B
t=3
C
t=
8

F
t=6

4
TL=8

TE=8
3

4
t=

t=6

6
I

TL=14

J
t=2

TL=8 t=7

TL=21
TL=21

8
TL=27

TE=27

TE=14

t=0

TE=8

IE =0

TE =12
TL=21

t=7

TE =5
TL =17

6
t=

Total, Free, Independent and

Interfering (TF-FF)

Activ Dura
ity
tion
1-2
1-4
1-3
3-4
2-5
4-5
4-6
3-7
5-8
6-8
6-7
7-8

5
3
8
0
4
4
6
7
6
2
7
6

SLACK
OR
FLOAT
EST EFT LST LFT
TF FF
0
0
0
8
5
8
8
8
12
14
14
21

5
3
8
8
9
12
14
15
18
16
21
27

12
5
0
8
17
17
8
14
21
25
14
21

17
8
8
8
21
21
14
21
27
27
21
27

12
5
0
0
12
9
0
6
9
11
0
0

Ind
Float
(IF)
0
5
0
0
3
0
0
6
9
11
0
0

0
5
0
0
0
0
0
6
0
11
0
0

Free float represents the amount of time that a schedule activity can be delayed without
delaying the early start date of any immediate successor activity within the network path.

Find TE & TL
D

3
B

8
I

7
F

6
C
4

2
G
2

TE & TL
TE =7

TE =11
D

4
TE =0
1

TE =5
A

TL =8

TL =12

8
I

5
TL =0

TL =13

6
TE =11
4

7
TL =20

TE =13
G

2
TL =11

TE =20

TE =13

2
TL =5

TL =18

Activity Duratio EST

n

EFT

LST LFT

1-2
2-3
2-4
3-5
3-6
4-5
4-7
5-8
6-8
7-8

0
5
5
7
7
11
11

5
7
11
11
11
13
13

0
6
5
9
8
11
16

5
8
11
13
12
13
18

13

20

13

20

11
13

19
15

12
18

20
20

5
2
6
4
4
2
2
7
8
2

TF

FF

0
1
0
2
1
0
5
0
1
5

0
0
0
2
0
0
0
0
1
5

IND
FLOA
T
0
0
0
1
0
0
0
0
0
0

Find Activity Times, Floats and

Critical Path
2

10
=
t

4
2

t=8

t=10

t=8

t=6

t=
1

t=5

t= 6

t=

t =1
2

t=12

TE=10

TE=0

10
=
t

1
TL=0

2
t=

t=8
TL=18

TE=26
5

3
TL=12

t=10

7
TL=40

t=8

TE=12

t=5

TE=52

TE=40

TL=26

t=6

TE=18
4

t=
1

t =1
2

t= 6

TL=18

TE=34
TL=34

t=12

8
TL=52

Earliest
Activity
(i-j)

Latest

Start
Time
(EST)

Finish
Time
(EFT)

Start
Time
(LST)

Finish
Time
(LFT)

Total
Float
Ft

Free
Float
Ff

Indepen
dent
Float

1-2

10

10

18

1-3

12

12

12

2-5

10

18

18

26

2-7

12

10

22

28

40

18

18

10

3-4

12

18

12

18

3-6

12

17

29

34

17

17

17

4-5

18

25

18

26

5-6

26

34

25

34

5-7

10

26

36

30

40

6-7

34

40

34

40

7-8

12

40

52

40

52

Find Critical Path

er
ia

ai t
Aw

rd
er

y
er
liv
De

m
at

Setup Tools
4
Ob
ta

in p
an
els
and
pa
3
int

5
Fabricate Frame
6

7
6

Fix panels

paints
26

Critical Path
1

m
r
e
rd

l
ir a
e
at

Aw
ai
2
tD
el
iv
er
y

Setup Tools

1
Ob
tain
Pa
ne
ls a
2
nd
p

2
Fabricate
Frame
ain
t

2
Fix Panels

1
Paints

Background & History

Developed in the 1950s by the US Navy
Originally, the critical path method considered
only logical dependencies between terminal
elements.
Expanded to allow for the inclusion of resources
related to each activity.
Critical Path Method for the construction
industry- Non-computer approach

What is CPM (Critical Path Method)

?
Mathematically based algorithm for scheduling a set
project activities.
Commonly used with all forms of projects, including

construction,
software development,
research projects,
product development,
engineering, and plant maintenance.

Any project with interdependent activities can apply

this method of scheduling.

CPM
It includes;
A list of all activities required to complete the
project (also known as Work Breakdown
Structure)
The time (duration) that each activity will take to
Completion.
The dependencies between the activities.
CPM calculates
The longest path of planned activities to the end of the
project
The earliest and latest that each activity can start and
finish without making the project longer

CPM
The earliest and latest that each activity can start
and finish without making the project longer
Determines critical activities (on the longest path)
Prioritize activities for the effective management
and to shorten the planned critical path of a project
by:
Pruning critical path activities
Fast tracking" (performing more activities in
parallel)
Crashing the critical path" (shortening the
durations of critical path activities by adding
resources)

The CPM Approach

Phase I
Break project into operations necessary for
completion.
Determine sequential relationship of
operations

Every operation must have event to mark

commencement i.e. completion of
preceding operation
Can operations overlap?

The CPM Approach

Phase II
Create time estimates for each operation

Determine earliest possible start date,

earliest possible finish date , latest start &
finish
Determine free float and total float
Revised after completion of Phase III

CPM Approach
Phase III
Establish time-cost relationship
Establish scheduling variations

Determine most favorable balance

between time-cost
Normal Start normal time, least cost
All-Crash Start least time, higher cost

CPM- Applications & Features

Very common for construction projects.
Building a new bridge across river Ganga.
Construction of multistory building.
Manufacture a new car model.

Less unique and repetitive in nature

Activities can be listed easily and
experience can be used for information on
duration, cost.etc.,
Realistic & more Accurate Information can
be obtained.

CPM
Provides a graphical view of the project.
Predicts the time required to complete the
project.
Shows which activities are critical to
maintaining the schedule and which are
not.

Activity Time Estimates in CPM

Deterministic Approach: Single Time
estimates. Narrow range & Deterministic.

S.No.
1

Activity i-j
1-2

Description of activities
Base slab

Duration tij
4

2-3

North apron

2-4

North side wall

2-5

South apron

3-6

Dummy

3-10

North approaches

16

4-5

Dummy

4-6

Dummy

4-8

South side wall

10

5-8

Dummy

11

5-10

South approaches

10

12

6-7

North wing wall

13

7-8

Dummy

14

7-9

North roof

15

15

8-9

South wing wall

16

9-10

South roof

15

t =5

t =16

t =7

t =15
t=0

t=0
t =4

t =7

t =5

t =8

t=0

t =8

t=

t =10

t =15

10

TE=9
TL=11

t =5
TE=11
TL=11

t =4

t =7

t=0
t =8

t =8

t=0

t =15

t=0

t =5

t =7

TE=18
TL=18

TE=19
TL= 25

TE=11
TL=25

TE=33
TL=33

TE=4
TL=4

TE=11
TL=11

t=

TE=0
TL=0

t =16

t =10

t =15

10

TE=48
TL=48

Activit Duration
y
i-j
tij

Activity

Total

FF

time
EFT

LST

LFT

EST

float

1-2

2-3

11

2-4

11

11

2-5

20

25

16

3-6

11

11

3-10

16

25

32

48

23

4-5

11

11

25

25

14

4-6

11

11

11

11

4-8

11

19

17

25

5-8

11

11

25

25

14

5-10

10

11

21

38

48

27

6-7

11

18

11

18

Ind.
Float

Activit Duration
y
i-j
tij

Activity time
EFT

LST

Total

FF

LFT

Indepe
ndent
Float

EST
float
1-2

2-3

11

2-4

11

11

2-5

20

25

16

3-6

11

11

3-10

16

25

32

48

23

23

4-5

11

11

25

25

14

4-6

11

11

11

11

4-8

11

19

17

25

5-8

11

11

25

25

14

5-10

10

11

21

38

48

27

27

6-7

11

18

11

18

7-8

18

18

25

25

7-9
33of time that
18 a schedule
33 activity
0 can be delayed
0
Free float15
represents the18
amount
without
delaying the
8-9
8 early start date
19 of any
27 immediate
25 successor
33 activity
6 within the
6 network path.

Remodeling of Laboratory

Rough in Plumbing &Electrical

Repair Wall & Ceiling

Strip Room

Repair Floor

Fume
Hood

Walls

Electrical
Plumbing

Chemical
Sink
Base Cabinet

Vinyl Flooring

Activity Activity Description

T (Days) EST

EFT

LST

LFT

TF

2
2
2

4
12
14

Strip room
Obtain fume hood
Obtain cabinet

3
10
10

0
0
0

3
10
10

1
4
3

4
14
13

1
4
3

2
2
2

20
24
28

Obtain chemical sink

Painter availability
Obtain vinyl floor
covering

10
20
5

0
0
0

10
20
5

7
0
21

17
20
26

7
0
21

4
4
6

6
8
8

Rough-in plumbing and

electrical
Replace exiting fume
duct
Dummy

5
3
0

3
3
8

8
6
8

4
6
9

9
9
9

1
3
1

6 10
8 10
10 12

Repair floor
Repair walls and celling
Dummy

1
4
0

8
8
12

9
12
12

12
9
14

13
13
14

4
5
2

10 14
12 16
14 16

Dummy
Install new fume hood
Dummy

0
1
0

12
12
12

12
13
12

13
14
15

13
15
15

1
2
3

Activity Description

T
(Days)

EST

EFT

LST

LFT

TF

14 22
16 18
18 20

Install wall cabinet

Install 1/3 base cabinet
Dummy

5
1
0

12
13
14

17
14
14

13
15
17

18
16
17

1
2
3

18 22
20 22
22 24

Install 2/3 base cabinet

Install chemical sink
Finish plumbing and electrical

2
1
2

14
14
17

16
15
19

16
17
18

18
18
20

2
3
1

24
24
26
28

Dummy
Paint cabinet
Paint wall and ceiling
Lay vinyl floor

0
6
3
1

20
20
20
26

20
26
23
27

23
20
23
26

23
26
26
27

3
0
3
0

26
28
28
30

Activity Identity Box

Draw the Network

C -6
A -7
G -3

B-3
D -3

F -2

E -3

H-2

A -7

13

C -6

13

G -3

B-3

13
F -2

13

18
H-2

E -3

D -3
10

16

16

18

A -7

C -6

13

13

G -3

B-3

16

13

10
F -2

H-2

E -3

D -3

13

18

16

18

Activity Times & Float

Activity Duration EST
EFT
LST
A
7
0
7
B
3
0
3
C
6
7
13
D
3
3
6
E
3
6
9
F
2
3
5
G
3
13
16
H
2
16
18

LFT
0
7
7
10
13
11
13
16

TF
7
10
13
13
16
13
16
18

FF
0
7
0
7
7
8
0
0

IF
0
0
0
0
7
0
0
0

Draw the AON Network

Start

Draw the Activity Identity Box

0
2

0
3

Draw the Gantt Chart showing

Critical Activities
A
B
C
D
E
F
G
H

Problem
Activity

IPA

Duration

B,C

D,E,F

Draw the Activity Oriented Diagram

Convert it to Activity on Node Diagram

B
A

D
d1
G

E
C

d2
F

B8
A5

D9
E6

C6

G1
F3

13
0

B8
13

A5

d1 13

D9

22
G1

E6
5

C6

11

d2

16
F3

22

16
B
A

D
E

G
G

23

23

Activity Duratio
n

EST

EFT

LST

LFT

TF

FF

13

13

11

10

16

13

22

13

22

13

19

16

22

11

14

19

22

22

23

22

23

TE=8
TL=9

TE=13
TL=14
D

t=5

t=
3

TE=15
TL=15
5

t=
7

F
4
TE=12
TL=12

t=9
J

3
t=

G
t=5

t=
5

t=
6

10

TE=5
TL=5

t=5

t=

TE=0
TL=0

7
TE=17
TL=19

TE=24
TL=24

5
6

B3

D3

8
9
A5

E6

13
14

13
14

15

15

12

5
5

C7

12
12

23
24

14
15

12

H10

24 24
I9

24 24

15
F3

12
14

15

G5

17
19

J5 23
24

F0

Activity
i-j

Activity
Duration t

EST

EFT

LST

LFT

Total
Float Tf

1-2

2-3

2-4

12

12

3-6

13

14

3-5

13

10

15

4-5

12

15

12

15

4-7

12

17

14

19

6-8

10

13

23

14

24

5-7

15

24

15

24

7-8

17

22

19

24

24

24

24

24

Remark

Critical

Critical

Critical

Critical

CPM Limitations
CPM was developed for complex but fairly
routine projects with minimal uncertainty in the
project completion times.
For less routine projects there is more
uncertainty in the completion times, and this
uncertainty limits the usefulness of the
deterministic CPM model.
An alternative to CPM is the PERT project
planning model, which allows a range of
durations to be specified for each activity.