Critical Path Method
CPM
Description also available in video format (attached below), for better experience use your desktop.
INTRODUCTION
- CPM
is a project management technique used for planning, scheduling,
and controlling complex projects.
- It
helps identify the longest sequence of dependent activities (called
the critical path) that determines the shortest time possible
to complete a project.
- Developed
in the 1950s by DuPont and Remington Rand Corporation.
OBJECTIVES
- To
identify the critical path
- To
determine project duration
- To
highlight activities that can be delayed (slack/floats)
- To
allocate resources effectively
IMPORTANT TERMS
|
Term |
Meaning |
|
Activity |
A task or job to be performed |
|
Event (Node) |
Start or end of an activity |
|
Critical Path |
Longest path from start to end with zero float |
|
Float (Slack) |
The time by which an activity can be delayed without
affecting the project |
|
Earliest Start (ES) |
Earliest time an activity can begin |
|
Earliest Finish (EF) |
ES + Activity duration |
|
Latest Start (LS) |
Latest time an activity can begin without delaying
the project |
|
Latest Finish (LF) |
LS + Activity duration |
STEPS
- List
all activities required for the project
- Determine
dependencies (which activity follows which)
- Draw
the network diagram
- Estimate
the time for each activity
- Find
all paths from start to finish
- Calculate
the total time for each path
- Identify
the critical path (longest duration path)
- Determine
floats/slack for non-critical activities
CHARACTERISTICS
- It
has zero slack/float
- Delay
in any critical activity will delay the whole project
- Helps
focus attention on essential tasks
- May
change during project execution due to delays or changes in
activities
ADVANTAGES
- Effective
planning and scheduling
- Identifies
critical and non-critical tasks
- Better
resource management
- Improves
project monitoring and control
- Enables
time-cost trade-off analysis
LIMITATIONS
- Assumes
deterministic time estimates (no uncertainties)
- Not
ideal for projects with repetitive tasks
- Requires
accurate input data
- Complex
for very large projects
APPLICATIONS
- Construction
projects
- Event
planning
- Hospital
renovations or equipment setup
- Software
development
- Research
and development projects
EXAMPLES
|
Activity |
Duration (Days) |
Depends on |
|
A |
2 |
- |
|
B |
4 |
A |
|
C |
3 |
A |
|
D |
2 |
B,
C |
- Paths:
- A
→ B → D = 2 + 4 + 2 = 8 days
- A
→ C → D = 2 + 3 + 2 = 7 days
- Critical Path: A → B → D (8 days)
Video Description
·
Don’t forget to do
these things if you get benefitted from this article
o
Visit our Let’s
contribute page https://keedainformation.blogspot.com/p/lets-contribute.html
o
Follow our page
o
Like & comment
on our post
·
Comments