0% found this document useful (0 votes)
91 views11 pages

Critical Path Method (CPM)

The document discusses the critical path method (CPM) for calculating the schedule of activities in a project. It describes the two-step process of performing a forward pass to calculate early start and finish times, followed by a backward pass to determine late start and finish times. Key outputs of CPM include identifying the critical path(s), calculating total float and other float types, and determining the overall project duration. The notation and computations for activities, events, and the project are demonstrated through an example network diagram.

Uploaded by

Haarika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
91 views11 pages

Critical Path Method (CPM)

The document discusses the critical path method (CPM) for calculating the schedule of activities in a project. It describes the two-step process of performing a forward pass to calculate early start and finish times, followed by a backward pass to determine late start and finish times. Key outputs of CPM include identifying the critical path(s), calculating total float and other float types, and determining the overall project duration. The notation and computations for activities, events, and the project are demonstrated through an example network diagram.

Uploaded by

Haarika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

28‐01‐2015

Critical Path  Method (CPM)

CM612

CPM Computations of AOA Networks
• Project Duration
• Critical Path(s)
• Start Times of All Activities
• Finish Times of All Activities
• Floats for All Activities
• Event Times of All Events

1
28‐01‐2015

Two‐Steps
• Forward Pass
– Start Event to End Event
– Left to right
– Early Times
• Backward Pass
– End Event to Start Event
– Right to Left
– Late Times

Activity Notation

Activity i‐j
i j
Dij

2
28‐01‐2015

Activity Computations
• Early Dates (ESij and EFij)
• Late Dates (LSij and LFij)
• Floats
– Total Float (TFLij)
– Free Float (FFLij)
– Independent Float (IDFij)
– Interfering Float (IFij)

Event Computations

• Early Event Time (EETi)

• Late Event Time (LETi)

3
28‐01‐2015

Project Computations

• Project Duration

• Critical Path(s)

Activity and Node Notation

EETi
i
LETi

ESij Activity i‐j EFij


i LSij LFij
j
Dij

4
28‐01‐2015

Forward Pass
• Start Event to End Event
• Calculate Early Activity and Event Times:
– EETi
– EETj
– ESij
– EFij

• Activity can start when all preceding activities 
are completed

Forward Pass
,  ,  ‐ ‐ ‐ ‐]
a
(AND) Condition

Activity i‐j
b i j

c = 

5
28‐01‐2015

Backward Pass
• End Event to Start Event
• LETlast node= EETlast node or project duration
• Late Times:



Backward Pass

= MIN , , ‐‐‐
x

i j y

(OR) Condition z

6
28‐01‐2015

Project Calculations
• Project Duration is Calculated
• Critical Path(s) Determined
– Longest Path
– Critical Activities are on Critical Path
• Critical Activities = 
• EETi=  LETi
• EETj= LETj
• ESij = LSij
• EFij= LFij
• TFLij=0

Float Calculations
• Total Float (TFLij)
• Free Float (FFLij)
• Independent Float (IDFij)
• Interfering Float (IFij)

7
28‐01‐2015

Total Float
• Amount of Time an Activity can be Delayed without 
Delaying the Project Completion
• (Start Float)
• OR
• (Finish Float)
• OR

Free Float
• Amount of Time an Activity can be Delayed without 
Delaying the Start of the Following Activity(s)

8
28‐01‐2015

Interfering Float (IFij)

Independent Float (IDFij)
• Amount of Time an Activity Can be Delayed without 
affecting the Preceding or Succeeding Activity(s)

9
28‐01‐2015

Activity Duration I.P.A Example


A 4 ‐
B 5 A
C 7 A
D 2 B
E 3 C
F 5 D,E
9
30
12

0 4 14 19
10 0 A 4
20 50 14 F 19 60
0
0 4 4
4 14 14 5 19 19

11
40
11

Activit Duratio ES EF LS LF TFL FFL


y n

A 4 0 4 0 4 0 0 Example
B 5 4 9 7 12 3 0
C 7 4 11 4 11 0 0
D 2 9 11 12 14 3 3
E 3 11 14 11 14 0 0
F 5 14 19 14 19 0 0
9
30
12

0 4 14 19
10 0 A 4
20 50 14 F 19 60
0
0 4 4
4 14 14 5 19 19

11
40
11

10
28‐01‐2015

B
5
H

E
1

D
7
B
5

H
E

1
6

D
7

11

You might also like