Arrow/Panah
i j
Kegiatan
Peristiwa
peristiwa
AOA DIAGRAM :
ACTIVITY ON ARROW DIAGRAMS
1 2
Node Node
Node
2 3
Kegiatan Kegiatan
Arrow
I-Node J-Node
task task
Logical
relationship
1 2 3
Task A Task B Task C Task D
L=2 L= - 2
.
B dimulai setelah 2 hari
Task C
kegiatan A selesai.
D dimulai sebelum 2 hari B
selesai .
C dimulai setelah A selesai.
D selesai setelah C selesai.
AOA equivalent Last 2 days
of Task D
First Nearly
2 part of all of Finish
Task days task B task D Task D
A delay
1 2 3 4 5 6
Task C
i dimulai
Saat paling j
selesai
12
B
A
C 10 11
B
C 13
A
D
B
C B
15
D
17 18
16 C
A B D
10 11 13 14
C
10 11 13 14
C
D
atau
D
A B
13 14
10 11
C
Dummy
12
Dummy
• Dummy =
connection with no duration , no source and
no space
Exsercise
11 B 13
D
E 12
D C
10 E 14
B C
Exsercise
B
E
E 10 12 14
D
C D
B 11 13 15
C
Exsercise
P C
A B
A
P
20 23
26 29
B
21 R
24
27 30
C
22 Q
25
28 31
Dummy
REFERENCE
• Tubagus Haedar Ali, 1995, Prinsip Prinsip
Network Planning, PT Gramedia Pustaka
Utama,Jakarta
• Edward M Willis, 1986, Scheduling
Construction Projects, Departemen of
Engineering Technology College of
Engineering,University of North Carolina at
Charlotte, John Willey &Sons.