Scribd
Upload
108 views2 pages

Critical Path

The Critical Path Method (CPM) calculates the minimum time needed to complete a project. It determines the earliest and latest start and finish dates of activities based on their duration and precedence relationships. The critical path is the longest sequence of activities and represents the minimum time possible to complete the project. CPM involves calculating the earliest and latest times for each event using forward and backward passes through the network. Activities on the critical path have their earliest start equal to latest start and earliest finish equal to latest finish.

Uploaded by

deltahawk61
Copyright
© Attribution Non-Commercial (BY-NC)
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
108 views2 pages

Critical Path

The Critical Path Method (CPM) calculates the minimum time needed to complete a project. It determines the earliest and latest start and finish dates of activities based on their duration and precedence relationships. The critical path is the longest sequence of activities and represents the minimum time possible to complete the project. CPM involves calculating the earliest and latest times for each event using forward and backward passes through the network. Activities on the critical path have their earliest start equal to latest start and earliest finish equal to latest finish.

Uploaded by

deltahawk61
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 2

Critical Path Method (CPM) Critical Path Method (CPM)

• CPM calculates the minimum completion time for a • Basic inputs to CPM
project along with the possible start and finish – Activity Definitions and Durations (Fixed)
times for the project activities – Temporal Precedence Relationships
• Critical path represents the set of sequence of – Start Date (0 or today is default)
predecessor/successor activities which will take – Master calendar - when is work underway
the longest time to complete.
• Basic outputs of CPM
• Critical path is also defined as the longest
– Earliest and Latest Start and Finish Dates
possible path through the network of project
– Earliest Project Completion
activities
– Activity and Resource Schedules by Calendar
Date
– Many different graphic and report formats

2402-461 Construction Management 2402-461 Construction Management

Critical Path Scheduling Critical Path Scheduling


Algorithm Algorithm (Cont.)
• Earliest event time: • Latest Event Time Algorithm
Step 1: Let E(0) = 0. Step 1: Let L(n) equal the required completion time of the project.
Note: L(n) must equal or exceed E(n).
Step 2: For j = 1,2,3,...,n (where n is the last event), let
E(j) = maximum {E(i) + Dij}
Step 2: For i = n-1, n-2, ..., 0, let
L(i) = minimum {L(j) - Dij}
where the maximum is computed over all activities (i,j) that
have j as the ending event.
where the minimum is computed over all activities (i,j) that have i
as the starting event
i j
.
n

2402-461 Construction Management 2402-461 Construction Management

1
Activity Time Activity Time
• The earliest start time for each activity • The latest finish time for each activity (i,j)
(i,j) is equal to the earliest possible time is equal to the latest possible time L(j) for
for the preceding event E(i): the succeeding event:
ES(i,j) = E(i) LF(i,j) = L(j)

• The earliest finish time of each activity • The latest start time of each activity (i,j)
(i,j) can be calculated by: can be calculated by:
EF(i,j) = ES(i,j)+Dij LS(i,j) = L(j)-Dij

2402-461 Construction Management 2402-461 Construction Management

Critical Activity
• An activity (i,j) is a critical activity if it
satisfies all of the following conditions:

E(i) = L(i)
E(j) = L(j)
E(i) + Dij =L(j)

2402-461 Construction Management

You might also like