0% found this document useful (0 votes)
80 views27 pages

Precedence Diagram Network: Project Planning, Scheduling and Control

This document discusses project planning, scheduling, and control using precedence diagramming and arrow diagramming. It introduces precedence diagrams (activities represented as nodes) and arrow diagrams (activities represented as arrows). It explains the four types of dependencies that can exist between activities in a project: finish-to-start (FS), start-to-start (SS), finish-to-finish (FF), and start-to-finish (SF). It provides examples of each dependency type and how lags affect the scheduling of dependent activities. Finally, it demonstrates how changing activity durations through lag or lead times impacts the project schedule in a precedence diagram network.

Uploaded by

james wtach
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
80 views27 pages

Precedence Diagram Network: Project Planning, Scheduling and Control

This document discusses project planning, scheduling, and control using precedence diagramming and arrow diagramming. It introduces precedence diagrams (activities represented as nodes) and arrow diagrams (activities represented as arrows). It explains the four types of dependencies that can exist between activities in a project: finish-to-start (FS), start-to-start (SS), finish-to-finish (FF), and start-to-finish (SF). It provides examples of each dependency type and how lags affect the scheduling of dependent activities. Finally, it demonstrates how changing activity durations through lag or lead times impacts the project schedule in a precedence diagram network.

Uploaded by

james wtach
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

Project Planning, Scheduling and Control

Precedence Diagram Network

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

G Arrow Diagram
E
N
(Activity On Arrow)
I

B L O
K
H P
A C M

F
D J

E
6
I
9
Precedence Diagram
(Activity On Node)

A D K N
8 4 3 8 4

1 3

B C H J L
STA. 9 6 7 4 3 FIN.
2

F G M
2 12 6

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

A C Arrow Diagram
Type of dependency:
D1
B E FINISH to START (FS)

B E Precedence Diagram
Type of dependency:
A D G
FINISH to START (FS)
START to START (SS)
FINISH to FINISH (FF)
C F
START to FINISH (SF)

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Finish to Start (FS) Start to Start (SS)


dependency dependency
d (+) = lag d (+) = lag
A A
d (-) = lead d (-) = lead
d
d
B B

Activity B can start d days after Activity B can start d days after
its predecessor (activity A) finished its predecessor (activity A) started

Example: Example:
We start writing the answer after We start writing the lecture note after
we finish reading the question. the professor starts delivering the lecture.

Finish to Finish (FF) Start to Finish (SF)


dependency dependency
A
A
d d (+) = lag
d
d (-) = lead d (+) = lag
B d (-) = lead
B

Activity B can finish d days after Activity B can finish d days after
its predecessor (activity A) finished its predecessor (activity A) started

Example: Example:
We finish writing our research draft We terminate our old finance system after
after we finish conducting analysis. we start to implement the new system.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Finish to Start (FS)


dependency
ID -2 -1 1 2 3 4 5 6 7 8 9 10 11 12 13
1
2 A A-B, FS(0)
3 B
4 A Move A by 2 days
5 B
6 A
7 B Move B by 2 days
8
9 A A-B, FS(+1)
10 B
11 A Move A by 2 days
12 B
13 A
14 B Move B by 2 days
15
16 A A-B, FS(-1)
17 B
18 A Move A by 2 days
19 B
20 A
21 B Move B by 2 days

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Start to Start (SS)


dependency
ID -2 -1 1 2 3 4 5 6 7 8 9 10 11 12 13
1 A A-B, SS(0)
2 B
3 A Move A by 2 days
4 B
5 A
6 B Move B by 2 days
7
8 A A-B, SS(+1)
9 B
10 A Move A by 2 days
11 B
12 A
13 B Move B by 2 days
14
15 A A-B, SS(-1)
16 B
17 A Move A by 2 days
18 B
19 A
20 B Move B by 2 days

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Finish to Finish (FF)


dependency
ID -2 -1 1 2 3 4 5 6 7 8 9 10 11 12 13
1
2 A A-B, FF(0)
3 B
4 A Move A by 2 days
5 B
6 A
7 B Move B by 2 days
8
9 A A-B, FF(+1)
10 B
11 A Move A by 2 days
12 B
13 A
14 B Move B by 2 days
15
16 A A-B, FF(-1)
17 B
18 A Move A by 2 days
19 B
20 A
21 B Move B by 2 days

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Start to Finish (SF)


dependency
ID -4 -3 -2 -1 1 2 3 4 5 6 7 8 9 10 11
1
2 A A-B, SF(0)
3 B
4 A Move A by 2 days
5 B
6 A
7 B Move B by 2 days
8
9 A A-B, SF(+1)
10 B
11 A Move A by 2 days
12 B
13 A
14 B Move B by 2 days
15
16 A A-B, SF(-1)
17 B
18 A Move A by 2 days
19 B
20 A
21 B Move B by 2 days

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Comparison between
FS and SS dependency
ID -2 -1 1 2 3 4 5 6 7 8 9 10 11 12 13
1
2 A A-B, FS(-1)
3 B
4 A Move A by 2 days
5 B
6 A
7 B Move B by 2 days
8 A Extend A by 2 days
9 B
10 A
11 B Extend B by 2 days
12
13
14 A A-B, SS(+2)
15 B
16 A Move A by 2 days
17 B
18 A
19 B Move B by 2 days
20 A Extend A by 2 days
21 B
22 A
23 B Extend B by 2 days

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Comparison between
FS and SF dependency
ID -2 -1 1 2 3 4 5 6 7 8 9 10 11 12 13
1
2 A A-B, FS(0)
3 B
4 A Move A by 2 days
5 B
6 A
7 B Move B by 2 days
8 A Extend A by 2 days
9 B
10 A
11 B Extend B by 2 days
12
13
14 A B-A, SF(0)
15 B
16 A Move A by 2 days
17 B
18 A
19 B Move B by 2 days
20 A Extend A by 2 days
21 B
22 A
23 B Extend B by 2 days

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

A B A B

A – B : FS A – B : SS

A A
Arrow OUT Arrow IN

B B
START
Node number FINISH
side side
ES EF
Duration
Arrow IN LS LF Arrow OUT

Activity name
A A

Arrow OUT Arrow IN


B B

A – B : FF A – B : SF

A B A B

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

FORWARD calculation

From project START to project FINISH Arrow IN


at START
ES = max | all Arrow IN at Start | ES EF Arrow IN
d at FINISH
EF = max | all Arrow IN at Finish, ES+d |
A
To figure out the Project Duration

Note: this formulation is applicable if ‘split activity’ is allowed

BACKWARD calculation

From project FINISH to project START

Arrow OUT LF = min | all Arrow OUT at Finish |


at START
d LS = min | all Arrow OUT at Start, LF-d |
LS LF
A Arrow OUT
at FINISH To figure out the Critical Activities & Float

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

FORWARD calculation

From project START to project FINISH Arrow IN


at START
ES = max | all Arrow IN at Start | ES EF Arrow IN
d at FINISH
EF = max | all Arrow IN at Finish, ES+d |
A
Check: if ES+d < EF then ES = EF-d

To figure out the Project Duration

Note: this formulation is applicable if ‘split activity’ is not allowed

BACKWARD calculation

From project FINISH to project START

Arrow OUT LF = min | all Arrow OUT at Finish |


at START
d
LS LF LS = min | all Arrow OUT at Start, LF-d |
A Arrow OUT
at FINISH
Check: if LF-d > LS then LF = LS+d

To figure out the Critical Activities & Float

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Example 1

SS 7

2 3
ES EF ES EF FF 3
20 16
LS LF LS LF
B C

1 5
ES EF ES EF
10 10
LS LF LS LF
A E

4
ES EF
15
LS LF
D

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Step 1:
Forward Calculation

SS 7

2 3
10 30 17 33 FF 3
20 16
LS LF LS LF
B C

1 5
0 10 30 40
10 10
LS LF LS LF
A E

4
10 25
15
LS LF
D

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Step 2:
Backward Calculation

SS 7

2 3
10 30 17 33 FF 3
20 16
10 30 21 37
B C

1 5
0 10 30 40
10 10
0 10 30 40
A E

4
10 25
15
15 30
D

Total Start Finish


Act. Float Float Float
A 0 0 0
B 0 0 0
C 4 4 4
D 5 5 5
E 0 0 0

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Example 2
Note: assume that ‘split activity’ is allowed

2
SS 3 ES EF
14
LS LF
B

1 3 5 7
ES EF ES EF FS 2 ES EF ES EF
10 5 4 5
LS LF LS LF LS LF LS LF
A C E G

4 6
ES EF ES EF FF 3
7 10
LS LF LS LF
D F

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Step 1:
Forward Calculation

2
SS 3 3 17
14
LS LF
B

1 3 5 7
0 10 10 17 FS 2 19 23 23 30
10 5 4 5
LS LF LS LF LS LF LS LF
A C E G

4 6
10 17 17 27 FF 3
7 10
LS LF LS LF
D F

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Step 2:
Backward Calculation

2
SS 3 3 17
14
3 17
B

1 3 5 7
0 10 10 17 FS 2 19 23 23 30
10 5 4 5
0 10 10 17 21 25 25 30
A C E G

4 6
10 17 17 27 FF 3
7 10
10 17 17 27
D F Total Start Finish
Act. Float Float Float
A 0 0 0
B 0 0 0
C - 0 0
D 0 0 0
E 2 2 2
F 0 0 0
G - 2 0

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

If Split Activity allowed:


0 1 2 3 4 5 6 7 8 9
1 B 5 5 C 7
C
1 4 5 5 2 7
B
0 A 1 1 D 3 7 F 8
A
0 1 1 2 2 7 7 1 8
D F
+1
2 E 6 +1 E
3 4 7

If Split Activity not allowed:


0 1 2 3 4 5 6 7 8 9
1 B 5 5 C 7
C
1 4 5 5 2 7
B
0 A 1 1 D 3 7 F 8
A
0 1 1 2 2 4 7 1 8
D F
+1
2 E 6 +1 E
3 4 7

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

If Split Activity allowed:


0 1 2 3 4 5 6 7 8 9
1 B 5 5 C 7
C
1 4 5 5 2 7
B
0 A 1 1 D 5 7 F 8
A
0 1 1 2 2 7 7 1 8
D F
+1
2 E 6 +1 E
3 4 7

If Split Activity not allowed:


0 1 2 3 4 5 6 7 8 9
1 B 5 5 C 7
C
1 4 5 6 2 8
B
0 A 1 3 D 5 8 F 9
A
0 1 1 3 2 5 8 1 9
D F
+1
4 E 8 +1 E
4 4 8

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

If Split Activity allowed:


0 5 10 15 20 25 30
+3 3 B 17
+3
B
3 14 17
A
0 A 10 10 C
17 +2 19 E 23 23 G 30 C +2 E
0 10 10 10 5 17 21 4 25 25 5 30
G
D F
10 D 17 17 F 27 +3 +3
10 7 17 17 10 27

If Split Activity not allowed:


0 5 10 15 20 25 30
+3 3 B 17
+3
B
3 14 17
A
0 A 10 12 C
17 +2 19 E 23 27 G 32 C +2 E
0 10 10 12 5 17 23 4 27 27 5 32
G
D F
12 D 19 19 F 29 +3 +3
12 7 19 19 10 29

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Exercise 1 For this Precedence Diagram Network,


Note: assume that ‘split activity’ is not allowed - Carry out the network analysis
- Draw the logic barchart

A B +2 What if:
2 5 a) Activity D: duration = 3 days
b) Activity F: duration = 5 days
c) Activity D: duration = 1 day
+1 d) Activity H: duration = 4 day
C D e) Dependency F – G : FS +0
2 2 f) Dependency C – E : FF +0 deleted

G
E 1
3

+2
F
3

H I
2 2

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Exercise 2

Sebuah proyek terdiri atas rangkaian kegiatan A, B, C, D, E, F, G, H dengan


durasi berturut-turut adalah 2, 2, 2, 3, 4, 1, 3, 1 hari. Hubungan ketergantungan
antar kegiatan digambarkan dalam Precedence Diagram Network (PDN)
dengan hubungan Finish-to-Start dengan lag 0 hari sebagai berikut:

D E C
Start

F G H

a. Gambarkan Arrow Diagram Network (ADN) untuk proyek tersebut !


b. Tentukan durasi proyek dan gambarkan lintasan kritisnya pada ADN !
c. Hitung Free Float dan Total Float setiap kegiatan ! (sajikan dalam tabel)
d. Apa yang dimaksud dengan Lintasan Kritis, Free Float, Total Float ?

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Exercise 3

Sebuah proyek terdiri dari beberapa kegiatan dengan durasi dan hubungan
ketergantungan antar kegiatan seperti ditunjukkan dalam tabel berikut ini.

Activity Duration Successors Type of Lag


(days) relationship (days)
A 2 B FS 0
D SS 1
B 2 C FF 0
C 2 - - -
D 3 E SS 2
H FS 1
E 4 C FS 0
F 1 G FS 0
G 3 H FF 0
H 1 C FS 2

a. Gambarkan Precedence Diagram Network (PDN) pada proyek tersebut !


b. Tentukan durasi proyek dan gambarkan lintasan kritisnya pada PDN !
c. Gambarkan Time-Scaled Logic Barchart untuk kondisi Early Schedule !
d. Gambarkan Time-Scaled Logic Barchart untuk kondisi Late Schedule !

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Exercise 4
Sebuah proyek mempunyai barchart sebagai berikut:

ID Act. Dur. Successors Total Float -1 1 2 3 4 5 6 7 8 9 10 11


1 C 5d 6 1d C
2 G 2d 1FF+1 d 1d G
3 D 2d 2FS+1 d 1d D
4 A 2d 3,5SS+2 d,1SS 0d A
5 B 4d 7,8SS 0d B
6 H 1d 0d H
7 F 3d 6 0d F
8 E 4d 6FF 4d E

- Gambarkan Logic Barchart untuk kondisi Early Schedule.


(catatan: tidak dikehendaki adanya activity split)
- Tentukan kegiatan-kegiatan kritisnya.
- Hitung Total Float untuk setiap kegiatan.

Apabila:

a. Durasi kegiatan B diubah menjadi 2 hari.


b. Durasi kegiatan D diubah menjadi 4 hari.
c. Kegiatan D bisa dimulai 1 hari setelah kegiatan A selesai.
(pertanyaan a, b, c di atas masing-masing bersifat independent)

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.


Project Planning, Scheduling and Control

Exercise 5

Sebuah proyek terdiri dari beberapa kegiatan dengan durasi dan hubungan
ketergantungan antar kegiatan sebagai berikut:

Activity Duration Successors Type of Lag


(days) dependency (days)
A 4 B SS 0
C SS 0
D FS −1
E SS +2
B 3 G FS +2
C 5 G FS +2
D 2 E FF +1
F FS 0
E 2 G FS 0
F 3 B SF 0
C FF −1
G 1 −

a. Gambarkan Precedence Diagram Network (PDN) untuk proyek tersebut.


b. Lakukan analisis Forward Pass & Backward Pass, lalu tandai kegiatan kritisnya.
Ditentukan bahwa durasi setiap kegiatan harus berkesinambungan (activity split is
not allowed).
Gambarkan Logic Barchart (untuk kondisi Early Schedule) dan tandai kegiatan kritisnya.

Tarumanagara University, Graduate Program in Civil Engineering Onnyxiforus G.

You might also like