PENJADWALAN KASUS BEDAH MENGGUNAKAN IMPROVED MULTI-OBJECTIVE IMPERIALIST COMPETITIVE ALGORITHM

Salsabila Siti Aisyah, - and Endang Cahya Mulyaning, - and Khusnul Novianingsih, - (2025) PENJADWALAN KASUS BEDAH MENGGUNAKAN IMPROVED MULTI-OBJECTIVE IMPERIALIST COMPETITIVE ALGORITHM. S1 thesis, Universitas Pendidikan Indonesia.

Abstract

Penelitian ini membahas penjadwalan kasus bedah, yaitu masalah menjadwalkan pasien terhadap seluruh tahapan bedah dan sekaligus menugaskan sumber daya bedah untuk setiap tahapan bedah. Pada penelitian ini, penjadwalan kasus bedah dipandang sebagai Flexible Job Shop Scheduling Problem (FSJP). Untuk mengoptimalkan keseluruhan tahapan penjadwalan digunakan Improved Multi-Objective Imperialist Competitive Algorithm (IMOICA) yang menggunakan metode penyortiran non-dominan. Metode ini bekerja diawali dengan mengembangkan strategi hierarki sosial untuk memulai kerajaan. Kemudian, konsep Attraction and Repulsion (AR) digunakan dalam strategi asimilasi untuk meningkatkan kemampuan pencarian global dari algoritma. Selain itu, strategi revolusi digunakan untuk meningkatkan keberagaman populasi. Terakhir, Variable Neighborhood Search (VNS) dijalankan untuk lebih meningkatkan kemampuan eksploitasi algoritma ini. Hasil penelitian menunjukkan bahwa algoritma ini mampu menghasilkan penjadwalan kasus bedah yang optimal dan memenuhi fungsi tujuan serta fungsi kendala yang ada. This research studies a surgical case scheduling problem, which involves scheduling patients for all surgical stages and simultaneously assigning surgical resources for each surgical stage. In this study, surgical case scheduling is considered as a Flexible Job Shop Scheduling Problem (FSJP). To optimize the entire scheduling stages, the Improved Multi-Objective Imperialist Competitive Algorithm (IMOICA) is implemented, which employs the non-dominated sorting method. This method starts by developing a social hierarchy strategy to establish the empire. Then, the concept of Attraction and Repulsion (AR) is used in the assimilation strategy to enhance the global search capability of the algorithm. Additionally, the revolution strategy is used to enhance the diversity of the population. Lastly, Variable Neighbourhood Search (VNS) is implemented to further enhance the exploitation capability of this algorithm. The computational results show that the method produces an optimal surgical case schedule that fulfils the objective and constraint functions.

Baca Full Text klik disini
[img] Text
S_MAT_2109161_Title.pdf
Download (456kB)
[img] Text
S_MAT_2109161_Chapter1.pdf
Download (99kB)
[img] Text
S_MAT_2109161_Chapter2.pdf
Restricted to Staf Perpustakaan
Download (815kB)
[img] Text
S_MAT_2109161_Chapter3.pdf
Download (721kB)
[img] Text
S_MAT_2109161_Chapter4.pdf
Restricted to Staf Perpustakaan
Download (614kB)
[img] Text
S_MAT_2109161_Chapter5.pdf
Download (155kB)
[img] Text
S_MAT_2109161_Appendix.pdf
Restricted to Staf Perpustakaan
Download (114kB)
Official URL: https://repository.upi.edu/
Item Type: Thesis (S1)
Additional Information: https://scholar.google.com/citations?view_op=new_profile&hl=en ID SINTA Dosen Pembimbing: Endang Cahya Mulyaning: 6121877 Khusnul Novianingsih: 258640
Uncontrolled Keywords: Penjadwalan Kasus Bedah, Flexible Job Shop Scheduling Problem, Improved Multi-Objective Imperialist Competitive Algorithm, Variable Neighborhood Search. Surgical Case Scheduling, Flexible Job Shop Scheduling Problem, Improved Multi-Objective Imperialist Competitive Algorithm, Variable Neighborhood Search.
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Pendidikan Matematika dan Ilmu Pengetahuan Alam > Program Studi Matematika - S1 > Program Studi Matematika (non kependidikan)
Depositing User: Salsabila Siti Aisyah
Date Deposited: 08 May 2025 01:54
Last Modified: 08 May 2025 01:54
URI: http://repository.upi.edu/id/eprint/133108

Actions (login required)

View Item View Item