Week

Project Scheduling

Semester Ganjil 2022/2023

Wegik Dwi Prasetyo, S.T.,M.S.

Department of Chemical Engineering Universitas Pertamina

Project Scheduling
Project scheduling are the cornerstone of the
planning and control system

deals with

the establishment of because its importance,

timetable and date project scheduling is included
in the contract

various resources (personnel

and equipment) will be utilized
to perform the activities to
complete the project
Estimating the Duration of Project Activities
The process of dividing tasks into activities and dividing activities into sub activities
should be performed carefully to have a proper balance between size and duration
Guidelines

If the number of activities is very large

The length of each activity should be (e.g.,>250) then the project should be
Critical activities that fall below this range
approximately in the range of 0.5% to 2% of divided into subprojects, perhaps by
should be included
the length of the project functional area and individual schedule
should be developed for each

If a project takes approximately 1 year, For example, a critical design review that Schedules with too many activities
then each activity should be between a last for 2 days in a 3-year project should become difficult to monitor and control
day and a week be included in the activities list because of
its pivotal importance
Approach to Estimate the Project Duration
Project Duration Estimation Approach

Deterministic Approach Stochastics Approach

ignores uncertainty thus result in point addresses the probabilistic elements in a

estimate project by estimating both the expected
duration of each activity and its corresponding
variance

CPM PERT
 Precedence Relations Among Activities

Project constraints Precedence Relations

Finish to Start to Start to Finish to

start start finish finish

Availability Technologi-
of cal Precedence Relations
resources constraints
Lead-lag Relationships in Precedence
Diagramming

FSAB : activity B can not start until at least FS time units after
the completion of activity A.

SSAB : activity B can not start until activity A has been in

progress for at least SS time units

FFAB : activity B can not finish until at least FF time units

after the completion of activity A

SFAB : there must be at least SF time units between the start

of activity A and the completion of activity B
 Models to Analyze Precedence Relations

Models

PERT
CPM
Gantt Chart (Program Evaluation and
(Critical Path Method)
Review Technique)
 Gantt Chart

Activity at
the vertical
axis

duration at the
horizontal axis
 Gantt Chart

E
Activity at
D
the vertical
axis C

11/16/2022 12/16/2022 1/15/2023 2/14/2023 3/16/2023

A B C D E F G
Start Date 44866 44866 44902 44902 44866 44959 44988
Durations 35 14 56 49 49 28 35

duration at the
horizontal axis
Critical Path Analysis using Activity-On-
Arrow Network (AOA)
Rule Each activity is only represented by
1 one and only one arrow in the
network
direction of progress
i j

tail head Rule No two activities can be identified by

2 the same head and tails event

3 4 Questions need to be addressed?

Rule (1) Which activities must be completed immediately
3 before this activity can start
(2) Which activities must immediately follow this
activity
2 (3) Which activities must occur concurrently with this
activity
Rule 2 : Dummy Activity

D1 = dummy activity ( it does not consume time or resources)

Example
• Suppose in a certain project, task A and B must precede C, where task
E is preceded only by B. Draw the AOA network.
Example of AOA
Draw the AOA Diagram so that the following precedence relations are
satisfied:
E is preceded by B and C
F is preceded by A and B
 C,8
2
A, 5
D1,0
1 B,3 D,7 F, 4 G,5
3 4 5 6

Node Node activity Durasi

E,7 1,2,4,5,6 A,C,F,G 22

1,3,4,5,6 B,D,F,G 19
1,4,5,6 E,F,G 16

1,2,3,4,5,6 A,D1,D,F,G 21
EXAMPLE
Activity Precedence
A -
Construct the AOA diagram that comprises
activities A,B,C,…..,L that the following B -
relationships are satisfied : C -
1. A,B,and C, the first activities of the project, D A,B
can start simultaneously E B
2. A and B precede D F B
G F,C
3. B precedes E,F,and H
H B
4. F and C precede G I E,H
5. E and H precede I and J J E,H
6. C,D,F,and J precede K K C,D,F,J
7. K precedes L L K
8. I,G,and L are the terminal activities of the
project
 D
2 7

A
D1 4 J 8

H
D2 L

B E I
1 3 5 9

D3

C G
6
Critical Path Analysis using Activity-On-
Node Network (AON)
An arrow specifies only precedence
Rule
All nodes, with exception of terminal relations; its length has no significance
Rule 5
node, must have at least one with respect to the time duration
1
successor accompanying either of the activities
that it connects.
Rule All nodes, except the first, must have
2 at least one predecessor

Cycles or closed-loop paths through the

Rule There should be only one initial and Rule
network are not permitted. They imply
3 one terminal node 6
that an activity is a successor of another
activity that depends on it.
Rule No arrows should be left dangling,
4 notwithstanding rules 1 and 2, every
arrow must have a head and a tail
Calculating Activity Start and Finish Time
Calculating Activity Start and Finish Time
 Calculating Activity Start and Finish Time

 Thus, the earliest time when an activity can begin is

equal to the early time of its start event; the latest an
activity can finish is equal to the late finish of its finish
event.
For activity D in the example, which is denoted by arc
(3, 4) in the network, we have :
ES34 = t3 = 5 and
LF34 = T4 = 13

 The earliest time when an activity can finish is given

by its ES plus its duration; the latest time when an
activity can start is equal to its LF minus its duration.
For activity D, this implies that :
EF34 = ES34 + L34 = 5 + 7 = 12, and
LS34 = LF34 - L34 = 13 - 7 = 6
Important Definition and Concept
 Important scheduling information for the project manager is the earliest and latest
times when each event can take place without causing a schedule overrun

 The early time of an event i is determined by the length of the longest sequence
from the start node (event 1) to event i. Denote as the early time of event i, and let
implying that activities without precedence constraints begin as early as possible.

 To determine for each event i, a forward pass is made through the network. Let
be the duration or length of activity (i, j).The following formula is used for the
calculations:
Important Definition and Concept
 The late time of each event is calculated next by making a backward pass through
the network. Let denote the late time of event i. If n is the finish event, then the
calculations are generally initiated by setting and working backward toward the
start event using the following formula:
Activity-On-Node Network (AON) :
Calculating Early Start and Early Finish Time
of Activities ES time for the initial activity is assumed to be
zero, as it is EF.
For all other activities, the EF time is equal to its
early start time plus its duration.

ES = Early Start
LS = Late Start
EF = Early Finish
Activity-On-Node Network (AON) :
Calculating Early Start and Early Finish Time
of Activities

ES = Early Start
LS = Late Start
EF = Early Finish
Activity-On-Node Network (AON) :
Calculating Late Start and Late Finish Time
of Activities

TS = Total Slack
FS = Free Slack
Activity-On-Node Network (AON) :
Calculating Late Start and Late Finish Time
of Activities
 Activity B didelay 2 minggu
Activity E didelay 6 minggu
11/18/2022 12/23/2022 1/27/2023 3/3/2023
A B C D E F G
A Start Date 44866 44880 44901 44901 44908 44957 44985
Durations 35 21 56 49 49 28 35

G
Contoh : tentukan berapa lama non-critical
activity bisa didelay untuk project dibawah
Thank you