Académique Documents
Professionnel Documents
Culture Documents
L
J
M
L
[
M
W
[
R
R
J
O
I
O
U
"
"
"
"
K
O
W
K
W
W
M
W
W
M
[
W
Fin.&Eval.
Risk
Organization
Estimating
Planning&Scheduling
Planning&Scheduling
&
3
A
<
'
<
>
>
<
<
Outline
Objective
Objective
Bar Chart
Network Techniques
CPM
Outline
Bar Chart
9Objective
Henry L. Gantt
Bar Chart
Easy to Read
Network Techniques
CPM
Year 1
Year 2
1. Concept and
feasibility studies
2. Engineering
and design
Year 3
3. Procurement
4. Construction
5. Start-up and
implementation
6. Operation or
utilization
.
Figure by MIT OCW.
Activity Aggregation
Hammock Activities
Activity Aggregation
Outline
Milestones
9Objective
Network Techniques
9Bar Chart
CPM
Network Scheduling
Advantages
Activity
Activity
A
A
Event i
Activity on Node
AON
Activity on Arrow
AOA
Activity
B
Event j
Communications
Interdependency
Expected Project Completion Date
Task Starting Dates
Critical Activities
Activities with Slack
Concurrency
Probability of Project Completion
Network - Definitions
t
Network - Definitions
j
d
c
e
k
c
e
b
l
Predecessor Activity of D
Successor Activity of F
Source: Badiru & Pulat, 1995
Definitions (Contd)
Definitions (Contd)
Activity
Arc
Restriction / Precedence
Milestone
Predecessor Activity
Successor Activity
Descendent Activity
Antecedent Activity
Node
Dummy
A line that connects two nodes and can be a representation of an event or an activity
Definitions (Contd)
Outline
Merge Point
9Objective
Burst Point
9Bar Chart
Network Techniques
Network
CPM
Path
~1958
Construction Projects
Deterministic Times
CPM Objective
CPM Precedence
Activity-on-Arrow
n
w
Technical Precedence
Procedural Precedence
Activity-on-Node
Imposed Precedence
CPM Calculations
Forward Pass
Early Start Times (ES)
It
Its 8am. Suppose you want to know the earliest time you can
arrange to meet a friend after performing some tasks
CPM Calculations
Backward Pass
Late Start Times (LS)
Your friend will arrive at 9am. You want to know by what time
you need to start all things
Slack or Float
CPM Example
It
Its 8am, and you know that your friend will arrive at 9am. How
much do you have as free time?
Forward Pass
Forward Pass
ES(k)
ES(k) = Max{EF(i)},
Max{EF(i)}, i P(k)
P(k)
EF(k)
EF(k) = ES(k)
ES(k) + D(k)
D(k)
ES(k)
ES(k) = Max{EF(i)},
Max{EF(i)}, i P(k)
P(k)
EF(k)
EF(k) = ES(k)
ES(k) + D(k)
D(k)
Backward Pass
Backward Pass
LF(k)
LF(k) = Min{LS(j)}
Min{LS(j)} j S(k)
S(k)
LS(k)
LS(k) = LF(k)
LF(k) D(k)
D(k)
LF(k)
LF(k) = Min{LS(j)}
Min{LS(j)} j S(k)
S(k)
LS(k)
LS(k) = LF(k)
LF(k) D(k)
D(k)
Slack or Float
TS(k)
TS(k) = {LF(k
{LF(k)) - EF(k)}
EF(k)} or {LS(k
{LS(k)) - ES(k)}
ES(k)}
FS(k)
FS(k) = Min{ES(j)}
Min{ES(j)} - EF(k)
EF(k) j S(k)
S(k)
IF(k)
IF(k) = Max { 0, ( Min(ES(j))
Min(ES(j)) - Max(LF(i))
Max(LF(i)) D(k)
D(k) ) } j S(k),
S(k), i P(k)
P(k)
Critical Path
CPM Analysis
Critical Path
'
"
"
"
"
"
"
&
Path Criticality
!
"
"
"
"
"
"
"
"
"
"
D max E
D D
D min
O 0 100%
min = 0, max = 5
Path 2: [(5[(5-3)/(53)/(5-0)](100 %) = 40 %
Path 3: [(5[(5-4)/(54)/(5-0)](100 %) = 20 %
Path 4: [(5[(5-5)/(55)/(5-0)](100 %) = 0 %
<
>