Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
• 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
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
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)