| dc.contributor.advisor | Hanum, Farida | |
| dc.contributor.advisor | Mayyani, Hidayatul | |
| dc.contributor.author | Abdussalam, Salas | |
| dc.date.accessioned | 2026-07-16T04:29:07Z | |
| dc.date.available | 2026-07-16T04:29:07Z | |
| dc.date.issued | 2026 | |
| dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/174832 | |
| dc.description.abstract | Penelitian ini menerapkan Integer Linear Programming (ILP) untuk
merancang jadwal optimal bagi 12 regu satpam di Perumahan Permata Puri Laguna
Depok selama periode 30 hari. Fungsi objektif yang dibangun bertujuan
meminimalkan total beban kerja seluruh regu dengan memperhitungkan perbedaan
tingkat kelelahan antar shift, di mana shift malam diberi bobot dua kali lipat
dibandingkan dengan shift pagi. Model ini memuat delapan kendala operasional
yang wajib dipenuhi, mencakup kebutuhan minimal empat regu pada setiap shift
pagi maupun malam, larangan penugasan ganda dalam satu hari, pembatasan
jumlah maksimum shift malam dan hari kerja berturut-turut per regu, larangan shift
pagi setelah shift malam pada hari sebelumnya, serta batas maksimum hari libur per
periode. Formulasi model matematis disusun, diimplementasikan, dan divalidasi
untuk menghasilkan jadwal yang memenuhi seluruh kendala secara ketat.
Penelitian ini memberikan kontribusi praktis dalam manajemen keamanan
perumahan sekaligus menunjukkan penerapan nyata ILP dalam permasalahan
penjadwalan tenaga kerja. | |
| dc.description.abstract | This study applies Integer Linear Programming (ILP) to design an optimal
schedule for 12 security guard teams at Permata Puri Laguna Depok Residential
Complex over a 30-day period. The objective function is designed to minimize the
total workload across all teams by accounting for differences in fatigue levels
between shifts, where the night shift is assigned twice the weight of the morning
shift. The model incorporates eight of operational constraints that must be strictly
satisfied, including a minimum requirement of four teams for each morning and
night shift, a prohibition on double assignments within a single day, a maximum
limit on the number of night shifts and consecutive working days per team, a
restriction against assigning a morning shift immediately after a night shift on the
previous day, and a maximum number of days off per period. The mathematical
model was formulated, implemented, and validated to produce a schedule that fully
satisfies all constraints. This study provides a practical contribution to residential
security management while demonstrating a real-world application of ILP in
workforce scheduling problems. | |
| dc.description.sponsorship | | |
| dc.language.iso | id | |
| dc.publisher | IPB University | id |
| dc.title | Penjadwalan Petugas Satuan Pengaman di Perumahan
Permata Puri Laguna Menggunakan Integer Linear Programming | id |
| dc.title.alternative | | |
| dc.type | Skripsi | |
| dc.subject.keyword | integer linear programming | id |
| dc.subject.keyword | optimasi beban kerja | id |
| dc.subject.keyword | penjadwalan petugas pengaman | id |
| dc.subtype | Project > Case Studies | |