CPM/

PERT
Critical Path Method/ Project Evaluation and Review Technique
CRITICAL PATH METHOD
Is a project modeling technique that helps project
managers plan, schedule, and execute their project
effectively.
Example:
• Listing Project Tasks
• Identifying a project’s critical path
• Critical Path Diagram
• Dividing the Project into tasks
• Estimating Tasks
PROJECT
EVALUATION AND
REVIEW
• It is used to identifyTECHNIQUE
the time it takes to finish a
particular task or activity.
• It is a system that helps in the proper
scheduling and coordination of all tasks
throughout a project.
• It also helps in keeping track of the progress, or
lack thereof, of the overall project.
4
 Insert Image

FINDING CRITICAL
PATH
• Construct a project network
• Perform forward and backward passes
• Determine project completion time
• Calculate slack values
• State critical path

5
FOR
EXAMPLE:

ACTIVITY A B C D E F G
PREDECESSOR - - A A,B D C,E E
S
EXPECTED 7 9 12 8 9 6 5
TIME Where:
A = activity being described
A ES EF t = activity time
ES= Earliest Start
t LS LF EF= Earliest Finish
LS= Latest Start
LF= Latest Finish
 Insert Image

ACTIVITY A B C D E F G
PROJECT PREDECESSORS - - A A,B D C,E E

NETWORK: 7 9 12 8 9 6 5
EXPECTED TIME
(Weeks)

A 0 7 C 7 19 F 26 32
7 12 6
STAR FINIS
T B 0 9 D 9 17 E 17 26 G 26 31 H

9 8 9 5

FORMULA:
A E E • EF= ES + t

S F
Forward Pass = highest
value
• LS= LF – t

t L L
7
Backward Pass = lowest
value
Slack = LS – ES / LF – LF
 Insert Image

ACTIVITY A B C D E F G
PROJECT PREDECESSORS - - A A,B D C,E E

NETWORK: 7 9 12 8 9 6 5
EXPECTED TIME
(Weeks)

A 0 7 C 7 19 F 26 32
32
7 2 9 12 14 26 6 26 32 weeks
STAR FINIS
T B 0 9 D 9 17 E 17 26 G 26 31 H

9 0 9 8 9 17 9 17 26 5 27 32

FORMULA:
A E E • EF= ES + t

S F
Forward Pass = highest
value
• LS= LF – t

t L L
8
Backward Pass = lowest
value
Slack = LS – ES / LF – LF
 Insert Image

ACTIVITY A B C D E F G
PROJECT PREDECESSORS - - A A,B D C,E E

NETWORK: 7 9 12 8 9 6 5
EXPECTED TIME
(Weeks)

A 0 7 C 7 19 F 26 32
32
7 2 9 12 14 26 6 26 32 weeks
STAR S= 2 S= 7 S= 0 FINIS
T B 0 9 D 9 17 E 17 26 G 26 31 H

9 0 9 8 9 17 9 17 26 5 27 32
S= 0 S= 0 S= 1
S= 0
A E E FORMULA:
• EF= ES + t

S F Forward Pass = highest

t L L
9
Backward Pass = lowest
value
Slack = LS – ES / LF – EF
 Insert Image

SLACK:
• how long the activity can be delayed without extending
or increasing the project completion time.

CRITICAL PATH:
• the longest sequence of tasks that must be completed
to execute a project. The tasks on the critical path are
called critical activities because if they're delayed,
the whole project completion will be delayed.
10