Analysis Of Course Distribution Scheduling For Lecturers Using Genetic Algorithms And Constraint Satisfaction Methods At Batam University

Sony Putra; Muhammad Iqbal; Andysah Putera Utama Siahaan

Authors

Sony Putra Magister Teknologi Informasi, Universitas Pembangunan Panca Budi
Muhammad Iqbal Magister Teknologi Informasi, Universitas Pembangunan Panca Budi
Andysah Putera Utama Siahaan Magister Teknoogi Informasi, Universitas Pembangunan Panca Budi

Keywords:

Course Scheduling, Genetic Algorithm, Constraint Satisfaction, Schedule Optimization, Batam University

Abstract

Optimal course scheduling is a significant challenge in university academic management, especially in allocating courses to lecturers efficiently. This study aims to analyze the application of Genetic Algorithm and Constraint Satisfaction Method in optimizing the scheduling of course distribution at Batam University. Genetic Algorithm is used to find the optimal solution through the evolution process, while the Constraint Satisfaction method is used to ensure that all scheduling constraints, such as the availability of lecturers, classrooms, and time, are met. This research method involves collecting data on course schedules, lecturer preferences, and classroom capacity. Furthermore, the implementation of the algorithm is carried out through computer simulations with population, mutation, and crossover parameters that are set to achieve the optimal solution. Based on the results of this study, the optimization achieved includes several important aspects. First, there were no schedule conflicts (zero conflicts) between courses, classrooms, and lecturers. Second, in terms of time efficiency, the automatic scheduling process runs faster than the manual method. Furthermore, the utilization of resources such as rooms and time has been used optimally, while the teaching load of lecturers is well distributed without any excess. Finally, constraint satisfaction has been achieved, where all constraints, such as no scheduling conflicts in space, lecturers, and time, have been successfully met.

Downloads

Download data is not yet available.

References

O. I. R. Farisi, S. Maysyaroh, and E. F. Dewi, “Penerapan Pewarnaan Graf pada Penjadwalan Mengajar Dosen Pendidikan Matematika Universitas Nurul Jadid,” Jurnal Matematika, vol. 11, no. 1, p. 10, 2021, doi: 10.24843/jmat.2021.v11.i01.p132.

D. Rohmayani, F. Hasabi Adiwijaya, A. Sudrajat, R. Burjulius, and S. Lena, “Sistem Informasi Penjadwalan Mata Kuliah Berbasis Web (Studi Kasus : Politeknik Tedc Bandung),” Journal Informatics and Electronics Engineering, vol. 02, no. 01, pp. 15–22, 2022.

N. Hasanah, R. Jannah, M. Syafii, and L. H. Hasibuan, “Penerapan Pewarnaan Graf Pada Penjadwalan Mata Kuliah Program Studi Matematika UIN Imam Bonjol Padang,” JOSTECH: Journal of Science and Technology, vol. 2, no. 2, pp. 103–112, 2022, doi: 10.15548/jostech.v2i2.4349.

T. N. Sa’adah, M. I. A. Fathoni, and A. C. Sari, “Aplikasi Pewarnaan Graf Pada Penjadwalan Uas Program Studi Pendidikan Matematika Unugiri Menggunakan Algoritma Welch-Powell,” Proximal: Jurnal Penelitian Matematika dan Pendidikan Matematika, vol. 6, no. 1, pp. 14–24, 2022, doi: 10.30605/proximal.v6i1.2139.

R. R. Mustafa, Y. Azhar, and N. Hayatin, “Pembuatan Jadwal Shift Perawat Dengan Menggunakan Metode Constraint Satisfaction,” Jurnal Repositor, vol. 2, no. 2, pp. 239–248, 2020, doi: 10.22219/repositor.v2i2.152.

A. Harfani, “Penerapan Metode Constraint Satisfaction Problem Pada Sistem Pakar Diagnosa Penyakit Shigellosis,” Journal of Informatics Management and Information Technology, vol. 2, no. 4, p. 150, 2022, [Online]. Available: https://hostjournals.com/jimat%7C10.47065/jimat.v2i4.179

W. A. Putri, “Sistem Pakar Mendiagnosa Penyakit Pneumonia Menggunakan Metode Constraint Satisfaction Problem (CSP),” Media Online), vol. 1, no. 1, pp. 9–13, 2021, [Online]. Available: https://ejurnal.seminar-id.com/index.php/bulletinds

R. F. Syahputra and Yahfizham, “Menganalisis Konsep Dasar Algoritma Genetika,” Bhinneka Jurnal Bintang Pendidikan dan Bahasa, vol. 2, no. 1, pp. 2963–6167, 2024, [Online]. Available: https://doi.org/10.59024/bhinneka.v2i1.643

R. I. E. Saragih and D. Nababan, “Penerapan Algoritma Genetika Pada Pengenalan Paragraf,” Journal Information System Development …, vol. 4, no. 1, pp. 4–7, 2019, [Online]. Available: https://122.200.2.179/index.php/isd/article/view/221

G. C. Ramadhan, P. Bagus W, and Y. Diah Rosita, “Penentuan Rute Optimal Untuk Jasa Pengiriman Barang Menggunakan Algoritma Genetika,” JTIM : Jurnal Teknologi Informasi dan Multimedia, vol. 5, no. 1, pp. 48–55, 2023, doi: 10.35746/jtim.v5i1.322.

A. Sufyanto, “Penyelesaian Masalah Heterogeneous Fleet Vehicle Routing Problem (HFVRP) Dengan Menggunakan Algoritma Genetika,” 2021.

F. O. Hardjasutanto, “Penerapan Algoritma Semut untuk Pencarian Jalur Terpendek,” no. 13510053, pp. 1–5, 2011.

P. D. Kusuma, R. A. Nugrahaeni, and D. Adiputra, “Coordinated Ambulance Routing Problem for COVID-19 by Using Cloud-Theory-based Simulated Annealing to Minimize Number of Unserved Patients and Total Travel Distance,” Engineering Letters, vol. 30, no. 3, pp. 955–963, 2022.

A. Rochman, “Penjadwalan Kuliah Menggunakan Metode Constraints Programming Dan Simulated Annealing,” Seminar Nasional Aplikasi Teknologi Informasi (SNATI), vol. 2012, no. Snati, pp. 15–16, 2012, [Online]. Available: http://journal.uii.ac.id/index.php/Snati/article/view/2916

T. Azad, H. F. Rahman, R. K. Chakrabortty, and M. J. Ryan, “Optimization of integrated production scheduling and vehicle routing problem with batch delivery to multiple customers in supply chain,” Memet Comput, vol. 14, no. 3, pp. 355–376, Sep. 2022, doi: 10.1007/s12293-022-00372-x.

T. Azad, H. F. Rahman, R. K. Chakrabortty, and M. J. Ryan, “Optimization of integrated production scheduling and vehicle routing problem with batch delivery to multiple customers in supply chain,” Memet Comput, vol. 14, no. 3, pp. 355–376, 2022, doi: 10.1007/s12293-022-00372-x.

M. Gendreau, “Solving an ambulance location model by tabu search,” Location Science, vol. 5, no. 2, pp. 75–88, 1997, doi: 10.1016/S0966-8349(97)00015-6.

J. Szymon and Z. Dominik, “Solving multi-criteria vehicle routing problem by parallel tabu search on GPU,” Procedia Comput Sci, vol. 18, pp. 2529–2532, 2013, doi: 10.1016/j.procs.2013.05.434.

M. Gendreau, G. Laporte, and F. Semet, “A dynamic model and parallel tabu search heuristic for real-time ambulance relocation,” Parallel Comput, vol. 27, no. 12, pp. 1641–1653, 2001, doi: 10.1016/S0167-8191(01)00103-X.

T. N. Rakhman, “Implementasi Algoritma Tabu Search Untuk Menyelesaikan Vehicle Routing Problem (VRP) Pada Aplikasi Pendistribusian Barang,” 2019.