Beruflich Dokumente
Kultur Dokumente
Dr. Hermawan
Construction Management (120405)
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
Outline
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
Project Life Cycle
Scheduling
(Source: Abduh,2017)
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
Introduction
• The critical path method (CPM) is a planning and control technique
that provides an accurate, timely, and easily understood picture of
the project.
• Its purpose it to allocate resources over time in an optimal manner
and in a way that allows effective reallocation and schedule control,
after the project starts.
• In the 1950s 1. the program evaluation and review technique
(PERT) (by Willard Frazar, came out of the Navy’s need in managing
the Polaris Missile Program); 2. the critical path method (CPM) by
Du Pont and Rand Remington Univac.
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
Network Logic, Dependencies Among Activities - (1)
Starting Finishing
event Form Bridge event
Piers
(Activity name)
1 2
3 weeks
(Activity duration)
Atypical representation of an activity in the arrow diagram
A C
1 1
B D
2 2
Dummy activities are required in the arrow diagram to maintain the logic
of the network. A “dummy” is an activity of zero duration and no resource
utilization. It is simply a link (drawn as a broken line) between specific
preceeding and following activities.
A C
1 3 5
B D
2 4 6
The use of a dummy activity to maintain the logic of the arrow diagram
A C
1 2 3
B
An incorrect numbering of the activities A& B in the arrow diagram
A C
1 3 4
EFDI= ESDI+DurationI
The start event date of the first project activity must be known. For the
reason of simplicity, it is assumed to be zero, however computer
generated CPMprograms define the start date of the project to be week 1,
day 1, hour 1.
Where two or more preceeding activities I1, I2, …Inmeet in the same finish
node, wich becomes the start node of the following activity J,the ESDof the
activity J is equal to the maximum value of the EFD of the preceeding I
activities. This equationis:
ESDj= MAX(EFDI)
The latest event dates are calculated for each activity by working from the
end of the network to the beginning. This is referred to as the backward
pass. Because the EFD of the last activity determines the time duration of
the project, it must be equal of the latest finish event date (LFD) of the last
activity. When the time duration of the last activity is deducted from the
LFD,its latest start event date (LSD)is determined.
LSDI= LSDI-DurationI
Where two or more following activities J1, J2, …Jnoriginate from the finish
node of the preceeding activity I, the LFD of the activity I will be equal to
the minimumvalue of the LSDof the following Jactivities. The equation is:
LFDI= MIN(LSDJ)
The critical path is the longest path (in terms of time) through the
network. None of the activities on the critical path can be delayed
without delaying the scheduled finish date of the whole project.
FF (Activity name) TF
1 2
(Activity duration)
The convention for recording free and total floats on the arrow diagram
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
The Critical Path Method –Precedence Diagram
10 Activity Duration
A C
B D
A C
A E
START B E FINISH
C F
B F I
E H K
A D G J
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
Diagram Total Float
L L
B F I
E H K
A D G J
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
D r . H e r m a w a n – CM ( 1 2 0 4 0 5 )
Cont. Precedence Diagram
• While the arrow diagram is event oriented, the precedence diagram is
activity oriented.
• Despite this difference, the time duration of the entire project is the
same as for the arrow diagram. The critical activities will have the
same earliest and latest start dates, and earliest anda latest finish
date.
1 ESD –EFD 3
FF TF
5 4 LSD –LFD 2 6
10 Activity Duration
The convention for recording start and finish dates, and free and total floats on
the precedence diagram