SALSA BELLA, OKTARIANI (2026) PENERAPAN PEWARNAAN GRAF DALAM PENJADWALAN KERJA PEGAWAI MIE GACOAN KEDATON MENGGUNAKAN ALGORITMA TABUSEARCH. FAKULTAS MATEMATIKA DAN ILMU PENGETAHUAN ALAM, UNIVERSITAS LAMPUNG.
|
Text
ABSTRAK.pdf Download (72kB) | Preview |
|
![[img]](http://digilib.unila.ac.id/style/images/fileicons/text.png) |
Text
SKRIPSI FULL.pdf Restricted to Repository staff only Download (4MB) | Request a copy |
|
|
Text
SKRIPSI TANPA BAB PEMBAHASAN.pdf Download (611kB) | Preview |
Abstract
Penjadwalan kerja pegawai merupakan aspek penting dalam operasional restoran karena berkaitan dengan efektivitas pelayanan dan efisiensi kerja. Penyusunan jadwal secara manual sering menimbulkan permasalahan akibat banyaknya pegawai dan aturan kerja yang harus dipenuhi. Penelitian ini bertujuan untuk menerapkan pewarnaan graf menggunakan algoritmaTabu Searchpada penjadwalan kerja pegawai Mie Gacoan Kedaton. Pegawai direpresentasikan sebagai simpul dan konflik penjadwalan sebagai sisi dalam graf konflik. Proses pewarnaan graf digunakan untuk membentuk kelompokshiftkerja yang bebas konflik, kemudian hasilnya diinterpretasikan ke dalam modelConstraint Programmingdengan mempertimbangkan berbagai kendala operasional. Hasil penelitian menunjukkan bahwa algoritmaTabu Searchmenghasilkan 16 kelompok warna tanpa konflik (proper coloring) yang digunakan sebagai dasar pembentukan jadwal kerja. Selanjutnya, modelConstraint Programmingmenghasilkan jadwal kerja selama satu minggu yang memenuhi seluruh kendala operasional sehingga diperoleh jadwal yang layak (feasible) dan terstruktur. Kata kunci: penjadwalan kerja pegawai, pewarnaan graf, algoritmaTabu Search, Constraint Programming, graf konflik. Employee work scheduling is an important aspect of restaurant operations as it is closely related to service effectiveness and operational efficiency. Manual scheduling often creates problems due to the large number of employees and work regulations that must be fulfilled. This study aims to apply graph coloring using the Tabu Search algorithm to employee scheduling at Mie Gacoan Kedaton. Employees are represented as vertices, while scheduling conflicts are represented as edges in a conflict graph. The graph coloring process is used to form conflict-free work shift groups, and the results are interpreted into a Constraint Programming model by considering various operational constraints. The results show that the Tabu Search algorithm produces 16 conflict-free color groups (proper coloring) used as the basis for work scheduling. Furthermore, the Constraint Programming model generates a one-week employee schedule that satisfies all operational constraints, resulting in a feasible and structured schedule. Keywords:employee work scheduling, graph coloring, Tabu Search algorithm, Constraint Programming, conflict graph.
| Item Type: | Other |
|---|---|
| Subjects: | ?? 510 ?? |
| Divisions: | Fakultas MIPA > Prodi Matematika |
| Depositing User: | 2606715139 Digilib |
| Date Deposited: | 07 Jul 2026 03:31 |
| Last Modified: | 07 Jul 2026 03:31 |
| URI: | http://digilib.unila.ac.id/id/eprint/102130 |
Actions (login required)
 |
View Item |