PERANCANGAN DAN PENJADUALAN PROJEK

-NETWORK DIAGRAM-
(ACTIVITY ON NODE)
 Activity on Node
@
Precedence Diagram Method
Precedence Diagram Method
Activity-on-Nodes (AON) Network:
A graphical scheduling methodology composed of activity nodes &
relationship arrows that show the interactions and constraints between
activities.

Lag : A period of no activity that must elapse between two

events.
Lag (+ve) Waiting period
Lead (-ve)

Chapter 6 - Project Planning and Scheduling 3

Precedence Diagram Method

ES D EF
ES D EF
A
A
LS TF LF
LS TF LF

ES D EF
A
LS TF LF

4
Precedence Diagram Method
Activity Relationship
1. Finish to Start (FS)

The earliest that activity B can begin is when activity A is completed.

Activity Activity
A B

The earliest that activity B can start is 2 days after activity A is

completed.

Activity Lag=2 Activity

A B

5
Precedence Diagram Method
Activity Relationship
2. Start to Start (SS)

Activity B can begins as soon as Activity A The earliest that Activity B can start
begins. Activity B would be referred to as the is 2 days after Activity A start.
successor to Activity A.

Activity Activity
A A
Lag=2
Activity Activity
B B

6
Precedence Diagram Method
Activity Relationship
3. Finish to Finish (FF)

The earliest Activity B finish is 2

Activity B can be completed at the same
days after Activity A is
time as Activity A.
completed.

Activity Activity
A A
Lag=
Activity Activity 2
B B

7
Precedence Diagram Method
Activity Relationship
4. Start to Finish (SF)

The successor activity cannot finish until the current activity starts serves
virtually no purpose in construction scheduling. This relationship has the
activity pair headed in the wrong direction. (seldom use)

Activity
A

Activity
B

8
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method

Item ADM PDM

ES D EF
A A
LS TF LF
Activity
ES: Early Start LS: Late Start
EF: Early Finish LF: Late Finish
D : Duration TF: Total Float

A ES D EF 1 ES D EF
ES EF
1 2 A B
LS LF
Event LS TF LF LS TF LF

9
 ADM vs. PDM
ADM PDM

Early Start (ES) is the earliest possible time an activity can start
based on the logic & durations identified on the network.

Late Start (LS) is the latest possible time an activity can start without
extending the completing date of the project.

Early Finish (EF) is the earliest possible time an activity can finish if it is
start on Early Start Time (ES) and finish within the planned duration.

Late Finish (LF) is the latest possible time an activity can finish without
extending the completion date of the project.

Total Float (TF) is the maximum amount of time that the activity can
be delayed without extending the completion time of the overall
project.

10
 ADM vs. PDM
Differences between ADM and PDM Method
ADM
-A and B are activities. 1, 2 and 3 are events
-Activity A has ID or label 1-2 ; Activity B has ID or label 2-3
- Activity A precedes activity B

A B
1 2 3

PDM
Activity Nodes

ES D EF ES D EF ES D EF
1 2
A B B
LS TF LF LS TF LF LS TF LF
Predecessor Current Successor
Activity Activity Activity

11
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM PDM

Definition
Activity which has Dummy activity is not
Dummy not duration. It is used in Precedence
only used to show any Diagram Method (PDM)
Activity relationship between
activities.
D Function
• If there is a
or situation where one
event is used to show
relationship more
than one activity.
• To show a complicated
relationship clearly

12
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method (cont.)
Item ADM
Activity A & B have the same ID for Activity A & B are not
ID same.
A: 1-2 A: 1-2
B: 1-2 False B: 1-3 True
A A
Dummy 1 2
1 2
Activity B
3
B
D If C is to follow A & B, If C is to follow A & B,
but D is to follow only B. but D is to follow only B.
(not fulfill) (use dummy)
or
A C A C

B D B D

13
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM
If P, Q and R follow A, and B follows P, Q and R. The
following diagram is not the correct representation of the
P
same.
False
A Q B
Dummy 1 2 3 4
Activity R
Reason: Activities P, Q and R have the same ID (2-3).
D True
P 5
or
A Q B
1 2 3 4

R 6
Activities P has the ID (2-5), Q (2-3) and R (2-6).
14
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM
1. D is preceded by A only
2. E is preceded by A and B
3. F is preceded by B and C

Dummy False True

Activity
A D A D
D

or B E B E

C F C F
Statement 3 not fulfill
where F is preceded by A, B
and C.
15
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method (cont.)

Item ADM PDM

F – S
F – F
Relationship F - S S
S
–
-
S
F

- Critical Path
: A path consist of few activities which will determine the
overall project duration.
1. ESX = LSX, or
Critical path 2. LFX = EFX, or
3. Total Float (TF) =
- Possible0to have more than one critical path
- Activities which lay on critical path cannot suffer any delay

16
 ADM vs. PDM
Table 6.6 Differences between ADM and PDM Method (cont.)
Item ADM PDM

- Total float
: The maximum amount of time that the activity can be
delayed without extending the completion time of the
Total float overall project.
1. TF = LF – D – ES, or
2. TF = LS – ES , or
3. TF = LF – EF

- FORWARD PASS
: To establish the earliest expected start and finish
times for each activity in the network.
Estimating - BACKWARD PASS
duration : To establish the latest allowable start and finish
times for each activity in the network.

17
18
 Precedence Diagram Method
EXAMPLE 1
ACTIVITY DURATION(DAY) PREDECESSOR
A 2 START
B 6 A
C 6 B
D 1 B
E 3 A
F 3 D,E
G 2 C(+2) ,F

19
EXAMPLE 1

2 6 6
A B C

FS +2 2
G
1
D

3
F
3
E
20
EXAMPLE 1

FORWARD PASS

0 2 2 2 6 8 8 6 14
A B C
16,12

FS +2 16 2 18
G
8 1 9
D
5,9
9 3 12
F

2 3 5
E
Chapter 6 - Project Planning and Scheduling 21
EXAMPLE 1

BACKWARD PASS

0 2 2 2 6 8 8 6 14
A B C
0 2 2 8 8 14 16,12
2,10 8,12 FS +2 16 2 18
G
8 1 9 16 18
D
5,9
12 13
9 3 12
F

2 3 5 13 16
E
1022 13
EXAMPLE 1

COMPLETED

0 2 2 2 6 8 8 6 14
A B C
0 2 2 8 8 14 16,12

2,10 8,12 FS +2 16 2 18
G
8 1 9 16 18
D
5,9
12 13
9 3 12
F
2 3 5 13 16
E
10 13
23
 Total Float (TF) =LF-D-ES
=LF-EF
EXAMPLE 1

TFC = LF-
TOTAL FLOAT TFG = LF-
EF
EF
=14-14
0 2 2 2 6 8 8 6 14 =18-18
=0
=0
A B C
0 0 2 2 0 8 8 0 14
FS +2 16 2 18
TFB = LF-
TFA = LF- EF G
EF =8-8 8 1 9
=0 16 0 18
=2-2
D
=0
12 4 13
3 TFF = LF-EF
9 12
TFD = LF-EF =16-12
=13-9 F =4
=4
2 3 5 13 4 16
E
TFE = LF-EF
10 8 13 =13-5
24 =8
 EXAMPLE 1

FREE FLOAT
FFC = ESSUCC-EF-
0 2 2 2 6 8 8 6 14 Lag
A B C =16-14-2
=0
0 0 2 2 0 8 8 0 14
FS +2 16 2 18
FFA = ESSUCC-EF- FFB = ESSUCC-EF- FFF = ESSUCC-EF- G
Lag Lag 8 1 9 Lag
=8-8-0
16 0 18
=2-2-0 =16-12-0
=0 D =4
=0
12 4 13
FFD = ESSUCC-EF- 9 3 12
Lag FFA =
=9-9-0 F
ESSUCC-
=0 13 4 EF- Lag
2 3 5 16
=18-18-0
E =0

10 8 13
25
EXAMPLE 1

CRITICAL PATH Activities on critical path : A-B-C- G.

0 2 2 2 6 8 8 6 14
A B C
0 0 2 2 0 8 8 0 14 16,12

2,10 8,12 FS +2 16 2 18
G
8 1 9 16 0 18
D
5,9
12 4 13
9 3 12
F
2 3 5 13 4 16
E
10 8 13
26
27