UNIVERSITAS MERCU BUANA

FAKULTAS : TEKNIK
PROGRAM STUDI / JENJANG : TEKNIK SIPIL / S1

Nomor Dokumen ...........................

Tanggal Efektif 1 Maret 2020

ASESMEN UJIAN AKHIR SEMESTER

W111700030 / PERENCANAAN DAN PENGENDALIAN PROYEK

Tahun Akademik / Semester : 2019-2020 / Genap

Hari / Tanggal : Selasa / 7 Juli 2020

Ruang / Waktu : E-301 (online) / 10.15 – 12.45

Dosen : Ir.Agus Suroso, MT/ Yunita Dian

Suwandari,ST,MM,MT

SKS : 3 SKS

Asesmen CPMK (CPL) :

- CPMK 3 (CPL (9, 15, 22, 27, 29) (S9, KU5, KK3, P2, P4)),
- CPMK 4 (CPL (9, 15, 22, 27, 29) (S9, KU5, KK3, P2, P4)),
- CPMK 5 (CPL (9, 15, 22, 27, 29) (S9, KU5, KK3, P2, P4)),

Instruksi Peserta Ujian:

 Jawab semua pertanyaan yang diberikan.
 Hanya kalkulator scientific yang boleh digunakan.
 Untuk ujian ini, Anda diberikan sebagai berikut:
- Kertas jawaban
- ........................
 Tidak dibenarkan membawa catatan selama ujian.
 Tidak dibenarkan menggunakan HP selama ujian.

Jika Anda tidak bisa mematuhi instruksi di atas, maka bisa dianggap sebagai tindakan
menyontek atau tidak jujur dan akan dicatat sebagai aktivitas yang mencurigakan.
 UNIVERSITAS MERCU BUANA
FAKULTAS TEKNIK
PROGRAM STUDI TEKNIK SIPIL

TABLE 1
Activity A B C D E F G H I J K L M N O
Predecessors --- A A --- B C,D C,D D H F E,J F G,I G,I L,N
Duration 6 7 1 14 5 8 9 3 5 3 4 12 6 2 7
1. Construct an activity-on-branch network from the precedence relationships of activities in
the project given in the table 1 for the problem 1. CPMK 3 (CPL 9, 12, 22, 27 dan 29)

Determine the critical path and all slacks for the projects in Tables 1. (10%)
Suppose that the precedence relationships for Problem 1 in Table 1 are all direct finish-to-
start relationships with no lags except for the following:
- B to E: S-S with a lag of 2. ;
- D to H: F-F with a lag of 3. ;
- F to L: S-S with a lag of 2. ;
- G to N: S-S with a lag of 2. ;
- G to M: S-S with a lag of 2

Formulate an activity-on-node network representation and recompute the critical path

with these precedence relationships. (30%)

2. For the project defined in Problem No. 1, suppose that the early, most likely and late time
schedules are desired. Assume that the activity durations are approximately normally
distributed with means as given in Table 1 and the following standard deviations (SD):

Act SD Act SD Act SD

A 4 F 12 K 1
B 10 G 9 L 12
C 1 H 2 M 2
D 15 I 4 N 1
E 6 J 5 O 5
CPMK 4 (CPL 9, 12, 22, 27 dan 29)
a) Find the early, most likely and late time schedules, and (15%)
b) Estimate the probability that the project requires 25% more time than the expected
duration. (15%)

3. The time-cost tradeoff data corresponding to each of the Problems No.1, respectively are
given in the Table 2 for the problem No. 3. CPMK 5 (CPL 9, 12, 22, 27 dan 29)
a) Determine the all-crash and the project crash durations and cost based on the early
time schedule for the project. (15%)

1 SOAL INI BERSIFAT RAHASIA “HARUS DIKEMBALIKAN” | MILIK UNIVERSITAS MERCU BUANA
 b) Also, suggest a combination of activity durations which will lead to a project
completion time equal to two days longer than the project crash time but would
result in the (approximately) maximum savings. (15%)

TABLE 2 
Activity A B C D E F G H I J K L M N O
Shortest Possible
Completion Time 3 5 1 10 4 6 6 2 4 3 3 3 2 2 5
Normal Completion
Time Cost 150 250 80 400 220 300 260 120 200 180 220 500 100 120 500
Change in Cost Per Day
Earlier Completion 20 30 Infinity 15 20 25 10 35 20 Infinity 25 15 30 Infinity 10
Ya

2 SOAL INI BERSIFAT RAHASIA “HARUS DIKEMBALIKAN” | MILIK UNIVERSITAS MERCU BUANA