Implementation of the Constraint Satisfication Problems Method in Genetic Algorithms for Course Scheduling Systems

Main Article Content

Agust Isa Martinus
Mukhamad Budi Hartono
Freddy Wicaksono

Abstract

The creation of class schedules requires a high level of precision and focus to generate the best possible timetable. A schedule with the best solution can provide comfort for both faculty and students, thus enhancing the quality of early meetings during classes. However, in the engineering faculty of Muhammadiyah University Cirebon, classes often do not start simultaneously with other faculties due to the manual scheduling process. Addressing this issue, a system is needed to automate the creation of class schedules. By implementing the Constraint Satisfaction Problems method to impose constraints before evaluating the fitness values in the Genetic Algorithm, it can assist in searching for the best solutions in accordance with the scheduling requirements of each program in the Engineering faculty. The results of black box testing on the system, item code 06, demonstrate that the system can produce schedules that comply with the requirements of each program in the faculty.





 

Article Details

How to Cite
Isa Martinus, A., Budi Hartono, M., & Wicaksono, F. (2023). Implementation of the Constraint Satisfication Problems Method in Genetic Algorithms for Course Scheduling Systems. Jurnal Improsci, 1(3), 140–147. https://doi.org/10.62885/improsci.v1i3.149
Section
Articles
Author Biographies

Agust Isa Martinus, Universitas Muhammadiyah Cirebon

 

 

 

 

Mukhamad Budi Hartono, Universitas Muhammadiyah Cirebon

 

 

Freddy Wicaksono, Universitas Muhammadiyah Cirebon

 

 

 

References

Hartono Gunawan, “Penerapan Algoritma Evolusi Dengan Metode Generation Replacement Pada Aplikasi Penjadwalan Mata Kuliah,” 2013. [Daring]. Tersedia Pada: Https://Www.Researchgate.Net/Publication/268333411

Hikmawan, W. Gata, N. Mandiri, J. Damai No, W. Jati Barat, Dan J. Selatan, “Algoritma Genetika Dengan Mutasi Terbatas Untuk Penjadwalan Perkuliahan,” 2021. [Daring].Tersedia Pada: Http://Ejurnal.Ubharajaya.Ac.Id/Index.Php/Jki

Lianto Buliali, D. Herumurti, G. Wiriapradja, Dan J. T. Informatika, “Penjadwalan Mata Kuliah Dengan Menggunakan Algoritma Genetika Dan Metode Constraint Satisfaction,” 2008.

Mardiyah dan M. Ujianita Romdhini, “Penerapan Algoritma Genetika Dalam Penjadwalan Penerbangan Di Bandara Intenasioanal Lombok,” 2018. [Daring]. Tersedia Pada: Http://Eigen.Unram.Ac.Id

Mone Dan J. E. Simarmata, “Aplikasi Algoritma Genetika Dalam Penjadwalan Mata Kuliah,”Barekeng: Jurnal Ilmu Matematika Dan Terapan, Vol. 15, No. 4, Hlm. 615–628, Des 2021, Doi: 10.30598/Barekengvol15iss4pp615-628.

N. Dengen dan F. Chandra, “Implementasi Algoritma Constraint Satisfaction Problems Pada Sistem Penjadwalan Mata Kuliah,” 2018, [Daring]. Tersedia Pada: Http://Www.Unmul.Ac.Id/

N. Ananti, I. Cholissodin, dan B. Rahayudi, “Optimasi Penjadwalan Pekerja Shift Di Rumah Makan Cepat Saji (Fast Food Restaurant) Menggunakan Algoritma Genetika (Studi Kasus: Warung Gunung Di Kediri),” 2021. [Daring].

Nata dan K. Siahaan, “Analisis Dan Perancangan Sistem Informasi Manajemen Penjadwalan Praktikum Menggunakan Algoritma Genetika Di Laboratorium Fakultas Teknologi Pertanian Universitas Jambi,” 2018.

P. S. Ardiyani, “Perbandingan Algoritma Genetika Dengan Algoritma Steepest Ascent Hill Climbing Untuk Optimasi Penjadwalan Kuliah,” Jurnal Nasional Pendidikan Teknik Informatika (Janapati), Vol. 11, No. 1, Hlm. 63, Apr 2022, Doi:10.23887/Janapati.V11i1.43172.

Wiga Ayu Puspaningrum, Arif Djunaidy, Dan Retno Aulia Vinarti, “Penjadwalan Mata Kuliah Menggunakan Algoritma Genetika Di Jurusan Sistem Informasi,” 2013.