Penjadwalan (2)

Roy-Unpar
Metoda penjadwalan
1. Bar Chart / Gantt Chart
2. Network
Critical Path Method (CPM)
Precedence Diagram Method (PDM)
Program Evaluation and Review Technique (PERT)
3. Linear Method
Line of Balance
Time Chainage Diagram
 Network Diagram
1. Bar Chart sering tetap dibuat untuk membantu
“komunikasi” dengan orang lapangan dan orang
non-teknis
2. Jadwal diagram jaringan ini umumnya dibuat oleh:
Kontraktor jika masuk dalam masa tender
TIM yang berisi MK – Pemilik – Perancang
3. Harus selesai sebelum pekerjaan konstruksi berjalan
(it became baseline schedule and tool of judgment related
to project status of progress)
Network Diagram
1. Proses penyusunan memakan waktu relatif lebih
lama dibanding Bar Chart:
Dibutuhkan proses yang teliti dengan persiapan
yang matang
Cukup memakan waktu
Memerlukan sumber daya yang tidak sedikit
2. Selain penyusunannya, untuk mengintepretasikan
jadwal diagram jaringan diperlukan pelatihan
khusus
3. Agar mudah beradaptasi dengan perubahan
diperlukan bantuan komputer dan perangkat
lunaknya
Network Schedule
http://www.ifm.eng.cam.ac.uk/dstools/simulation/cpapert.html

A
 Network Schedule
http://www.ifm.eng.cam.ac.uk/dstools/simulation/cpapert.html

B
Bar Chart & Network Schedule

https://i.ytimg.com/vi/qTErIV6OqLg/maxresdefault.jpg
Bar Chart & Network Schedule

https://i.ytimg.com/vi/3a0jh2VuhNI/hqdefault.jpg
Network Diagram
1. Teknik penjadwalan yang baik perlu dipersiapkan oleh
sebuah TIM yang memiliki pengetahuan mendalam
tentang semua aspek proyek
2. Sebuah jadwal diagram jaringan lengkap memerlukan
seluruh pekerjaan terdefinisi dan teroganisir dengan
baik
3. Membuat jadwal diagram jaringan seperti membuat
proyek aktual di atas kertas (Gould & Joyce, 2000):
Penyusun harus mengindentifikasi seluruh aktivitas
Penyusun harus mengetahui logika urutan &
kebergantungannya bagaimana proyek akan
diselesaikan
Network Diagram
1. Setiap pekerjaan disebut sebagai “aktivitas” yang
memiliki durasi dan saling terhubung
(interrelationships) membentuk diagram jaringan
(network diagram)
2. Diagram jaringan menggambarkan “road map” menuju
tujuan proyek (how project will pursue)
3. Proses yang disusun dapat memicu perdebatan
“usually more than one way to build the project”
4. Diskusi dan analisis intensif terjadi pada penetapan
durasi dan urutan aktivitas this is good !!!
“Better to argue the planned approach in the office rather than
during the actual construction”
Notation and Basic Concept
1. Diagram jaringan memiliki dua bentuk :
Activity on arrow (AOA) Arrow Diagram Method
(ADM); CPM dan PERT
Activity on node (AON) Precedence Diagram
Method (PDM)
2. “Both are used with identical end results”

http://www.cpmtutor.com/c05/checklist.html
Network Schedule
http://www.ifm.eng.cam.ac.uk/dstools/simulation/cpapert.html

A
Network Schedule
A

https://www.slideshare.net/sidcalayag/ms-project-training-ver-01
Network Schedule
A

http://www.cpmtutor.com/c05/bp-multiplefollowers.html
 Network Schedule
B

https://project-management-knowledge.com/definitions/a/activity-on-node/
Network Schedule

https://www.slideshare.net/sidcalayag/ms-project-training-ver-01
Notation and Basic Concept
a = nomor node
b
a
c b = ES (Early Start) / EET (Earliest Event Time)
c = LS (Latest Start) / LET (Latest Event Time)

E (Earliest Time of Occurance )

Waktu paling awal peristiwa dapat terjadi.
L (Latest allowable Occurance Time)
Saat paling lambat yang masih diperbolehkan bagi suatu peristiwa
terjadi.
ES (Earliest Start)
Waktu mulai paling awal suatu kegiatan.
Sumber: Soeharto, 1995
EF (Earliest Finish)
Waktu Selesai paling awal suatu kegiatan.
EF suatu kegiatan terdahulu = ES kegiatan berikutnya
Notation and Basic Concept
LS (latest allowable start time)
Waktu paling lambat kegiatan boleh dimulai tanpa
memperlambat proyek secara keseluruhan.

LF (latest allowable finish time)

Waktu paling lambat kegiatan diselesaikan tanpa
memperlambat penyelesaian proyek.

D (activity duration time)

Kurun waktu yang diperlukan untuk suatu kegiatan (jam,
hari, minggu, bulan).

Sumber: Soeharto, 1995

Notation and Basic Concept

X (activity name)
D (activity duration time)

ES (Earliest Start)
LS (Latest allowable start time)

EF (Earliest Finish)
LF (latest allowable finish time)
“Basic Rule for Network”
1. Starting node of an activity is also usually finishing
node of one or more activities All activities with this
finishing node must be completed before activity starting
from that node can be commenced.

1
A

C
3 4
B

Lester, 2007
“Basic Rule for Network”
2. Each activity must have a different set of starting and
finishing node number.

A
1 2

B
A
1 3
B
d
2

Lester, 2007
Notation and Basic Concept
Dummy activity
Kegiatan berdurasi nol (0) digunakan hanya untuk
menjelaskan hubungan ketergantungan antara dua
kegiatan

The Critical Path (Jalur kritis)

Jalur yang terdiri dari rangkaian kegiatan dalam ruang
lingkup proyek awal-akhir. Bila 1 atau lebih terlambat
akan menyebabkan keterlambatan proyek secara
keseluruhan.
Kegiatan kritis ditunjukkan oleh EET = LET pada nodenya
Kegiatan non-kritis ditunjukkan oleh EET ≠ LET pada
nodenya
Notation and Basic Concept
Float
Sejumlah waktu tersedia dalam suatu kegiatan
sehingga memungkinkan
penundaan/perlambatan kegiatan tersebut,
tanpa menyebabkan proyek menjadi terlambat

TOTAL FLOAT : Total float is measured as the difference between

the early and late start dates (LS - ES) or the early and late finish
dates (LF – EF). On Critical Path the TF equal to zero.

FREE FLOAT : Free float is measured by subtracting the early

finish (EF) of the activity from the early start (ES) of the successor
activity.
Notation and Basic Concept

Jika kegiatan X berdurasi 16 hari :

Kegiatan X dapat dimulai paling cepat (E.S) hari ke 4 atau
Kegiatan X dapat dimulai paling lambat (L.S) hari ke 15.
maka
Kegiatan X selesai paling cepat (E.F) hari ke 20.
Kegiatan X selesai paling lambat (L.F) hari ke 31.

dst….
Perhitungan Maju & Perhitungan Mundur
(untuk menghitung Jalur Kritis)

EET j = EETi + d ( A)
wrd EETk = EET j + d ( B )

LET j = LETk − d ( B )
LETi = LET j − d ( A)
Network Component Sumber: Sutarni, N, 2010
Network Component

Sumber: Sutarni, N, 2010

Examples Sumber: Dr. Muchdie
Program Pascasarjana
Universitas Muhammadiyah Prof Dr HAMKA

Node
Kegiatan 2
Awal Akhir
1 2 A
4
1 3 B
2 4 C 1 6
3 4 D
3 5 E 5
4 6 F
3
5 6 G
 Examples
NO KEGIATAN TERGANTUNG DURASI
PADA
1 A - 11
2 B - 12 Perhitungan
3 C - 15 Maju atau
4 D A 5
Forward Pass
5 E B 8
6 F B 28
7 G C 14
8 H D,E 11 Sumber: Ir. Faisol AM, MS

EET j = EETi + t ( A)
EETk = EET j + t ( B )

15
 Examples
NO KEGIATAN TERGANTUNG DURASI
PADA
1 A - 11
2 B - 12 Perhitungan
3 C - 15
4 D A 5
Mundur atau
5 E B 8 Backward Pass
6 F B 28
7 G C 14
8 H D,E 11

LET j = LETk − t ( B)
LETi = LET j − t ( A)
Critical Path
EET = LET
TF = 0
Exercise
Activity Predecessor Act. Start End Pred.
A - A 1 2 -
B - B 1 3 -
C A C 2 4 A
D A D 2 5 A
E B E 3 ? B
F C F 4 ? C

C
A 2 4
D F
1

E
B 3 5
Exercise
3
B D
A (5) (6) F
1 2 5 6
(2) C E (3)
(3) (4)
4

Hitunglah Jumlah waktu penyelesaian proyek dan Total Float-nya!

Kurun Waktu
Node Paling Awal
(Hari)
Kegiatan Perhitungan
Mulai Selesai
i j t Maju
(ES) (EF)
1 2 A 2 0 2
2 3 B 5 2 7
2 4 C 3 2 5
3 5 D 6 7 13
4 5 E 4 5 9
5 6 F 3 13 16 Sumber: Soeharto, 1995
Exercise

3
B D
A (5) (6) F
1 2 5 6 Perhitungan
(2) C E (3) Mundur
(3) (4)
4

Hitunglah Jumlah waktu penyelesaian proyek dan Total Float-nya!

Kurun
Node Paling Awal Paling Akhir
Waktu
Kegiatan
(t) Mulai Selesai Mulai Selesai
i J
(ES) (EF) (LS) (LF)
1 2 A 2 0 2 0 2
2 3 B 5 2 7 2 7
2 4 C 3 2 5 6 9
3 5 D 6 7 13 7 13
4 5 E 4 5 9 9 13
5 6 F 3 13 16 13 16
Exercise

3
B D Perhitungan
A (5) (6) F
1 2 5 6 TOTAL
(2) C E (3) FLOAT
(3) (4)
4

Float Time atau Total Float (TF) = LS – ES atau LF – EF

Kurun
Total
Node Waktu Awal Akhir
Kegiatan
(t) Float
i j (ES) (EF) (LS) (LF) (TF)
1 2 A 2 0 2 0 2 0
2 3 B 5 2 7 2 7 0
2 4 C 3 2 5 6 9 4
3 5 D 6 7 13 7 13 0
4 5 E 4 5 9 9 13 4
5 6 F 3 13 16 13 16 0
 “Basic Network”
Dummy Activities

Activity IPA* B
A -
A D
B A 1 2 3 4
C A C
D B, C
*)IPA: Immediately preceding activity Activity Notation
(i-j)
A 1-2

B 2-3 Identify
C 2-3 The
D 3-4
Problem

Mubarak, 2005
 “Basic Network”
Dummy Activities

Activity IPA* Activity Notation

A - (i-j)
B A A 1-2

C A B 2-3
D B, C C 2-4
*)IPA: Immediately preceding activity
d 3-4
D 4-5

B d
3
A D
1 2 4 5
C

Mubarak, 2005
 “Basic Network”
Dummy Activities

Activity IPA* Activity Notation

A - (i-j)
B A A 1-2

C A d 2-3
D B, C B 3-4
*)IPA: Immediately preceding activity
C 2-4

D 4-5

d B
3
A D
1 2 4 5
C

Mubarak, 2005
“Basic Network”
Dummy Activities

Activity Notation
(i-j) B

A 1-2 A D
B 2-4 1 2 4 5

d 2-3 C
d
C 3-4 3
D 4-5

Activity Notation
(i-j)
B
A 1-2
B 2-4 A D
1 2 4 5
C 2-3
d 3-4
C d
3
D 4-5

Mubarak, 2005
“Basic Network”
Dummy Activities

B d
3
A D
1 2 4 5
C
B

A D
1 2 4 5

d C
d B 3
3
A D
1 2 4 5
C

A D
1 2 4 5
C d
3

Mubarak, 2005
“Basic Network”
Dummy Activities

Activity IPA
A -
B A
C A
D B
E B, C

Activity IPA
A -
B A
C A
D B
E B, C
F C

Mubarak, 2005
 Activity Notation
“Basic Network” (i-j)
Dummy Activities A 1-2

B 2-3
Activity IPA
C 2-4
A -
d 3-4
B A
C A D 3-5

D B E 4-5
E B, C

D
B
3
A
1 2 5
d
E
C
4

Mubarak, 2005
“Basic Network”
Dummy Activities

Activity IPA
A -
B A
C A
D B
E B, C B D
F C 3

A E
1 2 5 6

C F
4

Mubarak, 2005
“Basic Network”
Notes!

In larger projects, dummy activities may not only

increase the number of activity, but also complicate
the schedule.

This fact is one of the main disadvantages of arrow

network (AOA)

Thus the Activity on Node (AON)

is advancement
Mubarak, 2005
“Basic Network”
Example

Activity IPA* Node represent activity

A - Connected with arrows/lines
B A represent logical
C A
relationship
D B B D
3
E C,D A E
AOA 1 2 4 5
*)IPA: Immediately preceding
activity C

B D

AON A E

C
Mubarak, 2005
 B

“Basic Network” A D
1 2 3 4

C
Activity Notation
Activity IPA*
A -
(i-j) Identity
AO A 1-2 Problem
B A
A B 2-3
C A
C 2-3
D B, C
D 3-4
*)IPA: Immediately preceding activity

AON

A D

Mubarak, 2005
“Basic Network”

Activity IPA
A -
B A
C A
D B
E B, C

Activity IPA
A -
B A
C A
D B
E B, C
F C

Mubarak, 2005
“Basic Network”
Activity IPA
D
A - AO B
3
B A A
A
C A 1 2 5
d
D B
C
C
E B, C
4

AO
N B D

A END

C E

Mubarak, 2005
“Basic Network”

Activity IPA AO B D
3
A -
A
A E
B A 1 2 5 6
C A
D B C F
E B, C 4

F C

AO
N B D

A END
E

C F

Mubarak, 2005
“A hierarchy of Network”

A client or a top
manager may not
need to know the
details of the
construction help
presentation

A. De Marco, 2011
It’s a wrap