Show simple item record

dc.contributor.advisorHanum, Farida
dc.contributor.advisorMayyani, Hidayatul
dc.contributor.authorAbdussalam, Salas
dc.date.accessioned2026-07-16T04:29:07Z
dc.date.available2026-07-16T04:29:07Z
dc.date.issued2026
dc.identifier.urihttp://repository.ipb.ac.id/handle/123456789/174832
dc.description.abstractPenelitian 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.abstractThis 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.isoid
dc.publisherIPB Universityid
dc.titlePenjadwalan Petugas Satuan Pengaman di Perumahan Permata Puri Laguna Menggunakan Integer Linear Programmingid
dc.title.alternative
dc.typeSkripsi
dc.subject.keywordinteger linear programmingid
dc.subject.keywordoptimasi beban kerjaid
dc.subject.keywordpenjadwalan petugas pengamanid
dc.subtypeProject > Case Studies


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record