Project Scheduling
Basic CPM/PERT & Gant-
Chart
MS321-Manajemen Industri
& Proyek
INTRODUCTION
Schedule converts action plan into
operating time table
Basis for monitoring and controlling project
Scheduling more important in projects than
in production, because unique nature
Sometimes customer specified/approved
requirement-e.g: JKR projects
Based on Work Breakdown Structure (WBS)
NETWORK TECHNIQUES
PERT CPM
• Program Evaluation Critical Path Method
and Review Technique
Developed by El Dupont for
Chemical Plant Shutdown
• developed by the US Project- about
Navy with Booz same time as PERT
Hamilton Lockheed
• on the Polaris
Missile/Submarine
program 1958
Both use same calculations, almost similar
Main difference is probabilistic and deterministic in time
estimation
Gantt Chart also used in scheduling
NETWORK
Graphical portrayal of activities and
event
Shows dependency relationships
between tasks/activities in a project
Clearly shows tasks that must
precede (precedence) or follow
(succeeding) other tasks in a logical
manner
Clear representation of plan – a
powerful tool for planning and
Example of Simple Network –
Survey
Example of Network –
More Complex
DEFINITION OF TERMS IN A
NETWORK
Activity : any portions of project (tasks) which
required by project, uses up resource and consumes
time – may involve labor, paper work, contractual
negotiations, machinery operations Activity on
Arrow (AOA) showed as arrow, AON – Activity on
Node
Event : beginning or ending points of one or more
activities, instantaneous point in time, also called
‘nodes’
Network : Combination of all project activities and
the events
Emphasis on Logic in Network
Construction
Construction of network should be based on
logical or technical dependencies among
activities
Example - before activity ‘Approve Drawing’ can
be started the activity ‘Prepare Drawing’ must be
completed
Common error – build network on the basis of
time logic (a feeling for proper sequence) see
example below
WRONG !!! CORRECT
Example 1- A simple network
Consider the list of four activities for making a simple
product:
Activity Description Immediate
predecessors
A Buy Plastic Body -
B Design Component -
C Make Component B
D Assemble product A,C
Immediate predecessors for a particular activity are
the activities that, when completed, enable the start
of the activity in question.
Sequence of activities
Can start work on activities A and B
anytime, since neither of these activities
depends upon the completion of prior
activities.
Activity C cannot be started until activity
B has been completed
Activity D cannot be started until both
activities A and C have been completed.
The graphical representation (next slide)
is referred to as the PERT/CPM network
Network of Four Activities
Example 2
Develop the network for a project with following
activities and immediate predecessors:
Activity
Immediate
predecessors
A -
B -
C B
D A, C
E C
F C
G D,E,F
Try to do for the first five (A,B,C,D,E) activities
Network of first five activities
A D
1 3 4
E
B
C 5
2
We need to
introduce a
dummy activity
Network of Seven Activities
1 A 3 D 4 G
7
dummy E
B
C 5 F
2 6
Note how the network correctly identifies D, E, and F as the immediate
predecessors for activity G.
Dummy activities is used to identify precedence relationships correctly
and to eliminate possible confusion of two or more activities having
the same starting and ending nodes
Dummy activities have no resources (time, labor, machinery, etc) –
purpose is to PRESERVE LOGIC of the network
EXAMPLES OF THE USE OF
DUMMYACTIVITY
Network concurrent activities
a
a 2
1 2 1 Dummy
b 3
b
WRONG!!! RIGHT
Activity c not WRONG !
required for e
a
a e
d
1
b 1 b
e
d
c
2
c
WRONG
RIGHT
!!!
RIGHT
WRONG!!! RIGHT!!!
a d a d
1 1
b e b
2 2 4 e
c f c f
3 3
a precedes d.
a and b precede e,
b and c precede f (a does not precede f)
Scheduling with activity
time
Activity Immediate Completion
predecessors Time
(week)
A - 5
B - 6
C A 4
D A 3
E A 1
F E 4
G D,F 14
H B,C 12
I G,H 2
Total …… 51
This information indicates that the total time required
to complete activities is 51 weeks. However, we can
see from the network that several of the activities can
be conducted simultaneously (A and B, for example).
Earliest start & earliest finish time
We are interested in the longest path through the
network, i.e., the critical path.
Starting at the network’s origin (node 1) and using a
starting time of 0, we compute an earliest start (ES)
and earliest finish (EF) time for each activity in the
network.
The expression EF = ES + t can be used to find the
earliest finish time for a given activity.
For example, for activity A, ES = 0 and t = 5; thus
the earliest finish time for activity A is
EF = 0 + 5 = 5
Arc with ES & EF time
EF = earliest finish time
ES = earliest start time
Activity
2
,5]
A [0
5
1
t = expected activity
time
Network with ES & EF time
D[5,8] 5
2 3
E[ 10]
G[ 14
] 5,
6 [ 6,
5
10
F 4
0,
1 7
,24
A[
26]
C[5,9]
4 4 ,
I[2
4
]
]
5
2
1 6
, 21]
B[ H[ 9
0,6 12
6 ]
3
Earliest start time rule:
The earliest start time for an activity leaving a
particular node is equal to the largest of the earliest
finish times for all activities entering the node.
Tugas : Buatlah Network dari Tabel
berikut
Dikumpulkan _____,
__ Desember 2014
Sebelum jam 12.00
Sebagai kuliah
pengganti
KLONE COMPUTERS, INC
Precedence Relationships Chart
Immediate Estimated
Activity Predecessor Completion Time
A None 90
B A 15
C B 5
D G 20
E D 21
F A 25
G C,F 14
H D 28
I A 30
J D,I 45
Terima kasih atas
perhatiannya
