Vol. 6 No. 4 (2026): November 2026
Open Access
Peer Reviewed

Automatic University Course Scheduling Using A Multi-Constraint Genetic Algorithm For Room and Time Optimization

Authors

Sapriansyah , Heny Pratiwi , Ahmad Fahrijal Pukeng

Downloads

Received: 2026-10-02
Accepted: 2026-10-05
Published: 2026-10-05

Abstract

University course scheduling required simultaneous handling of resource conflicts, room capacity, and schedule quality. This study developed a Multi-Constraint Genetic Algorithm (MCGA) for automatic course scheduling using institutional data from STMIK Widya Cipta Dharma. The final dataset contained 141 optimized course offerings, 12 candidate rooms, five scheduling days, and six nominal time slots; room-capacity compliance was evaluable for 129 offerings (91.49%). A Standard Genetic Algorithm and MCGA were evaluated using identical feasibility domains and hard-conflict repair mechanisms. One-factor-at-a-time screening selected a population of 100, 500 generations, a crossover rate of 0.80, and a mutation rate of 0.02. Across 20 paired runs, both algorithms achieved zero lecturer, room, and cohort conflicts, with zero capacity excess among course offerings for which validated class-size data were available. MCGA increased mean room utilization from 0.6085 to 0.7800 and reduced mean cohort-day time gaps from 11.85 to zero. Paired Wilcoxon tests confirmed significant improvements in room utilization and time-gap reduction. The results showed that hierarchical feasibility handling combined with weighted post-feasibility objectives improved the quality of feasible university schedules without a material runtime penalty.

References

[1] S. Ceschia, L. Di Gaspero, and A. Schaerf, “Educational timetabling: Problems, benchmarks, and state-of-the-art results,” Eur. J. Oper. Res., vol. 308, no. 1, pp. 1–18, 2023, doi: 10.1016/j.ejor.2022.07.011.

[2] M. C. Chen, S. N. Sze, S. L. Goh, N. R. Sabar, and G. Kendall, “A Survey of University Course Timetabling Problem: Perspectives, Trends and Opportunities,” IEEE Access, vol. 9, pp. 106515–106529, 2021, doi: 10.1109/ACCESS.2021.3100613.

[3] A. Bashab et al., “Optimization Techniques in University Timetabling Problem: Constraints, Methodologies, Benchmarks, and Open Issues,” Comput. Mater. Contin., vol. 74, no. 3, pp. 6461–6484, 2023, doi: 10.32604/cmc.2023.034051.

[4] S. Abdipoor, R. Yaakob, S. L. Goh, and S. Abdullah, “Meta-heuristic approaches for the University Course Timetabling Problem,” Intell. Syst. with Appl., vol. 19, p. 200253, 2023, doi: 10.1016/j.iswa.2023.200253.

[5] N. M. Arratia-Martinez, P. A. Avila-Torres, and J. C. Trujillo-Reyes, “Solving a University Course Timetabling Problem Based on AACSB Policies,” Mathematics, vol. 9, no. 19, p. 2500, 2021, doi: 10.3390/math9192500.

[6] M. Mokhtari, M. V. Sarashk, M. Asadpour, N. Saeidi, and O. Boyer, “Developing a Model for the University Course Timetabling Problem: A Case Study,” Complexity, vol. 2021, p. 9940866, 2021, doi: 10.1155/2021/9940866.

[7] E. Rappos, E. Thiémard, S. Robert, and J.-F. Hêche, “A mixed-integer programming approach for solving university course timetabling problems,” J. Sched., vol. 25, no. 4, pp. 391–404, 2022, doi: 10.1007/s10951-021-00715-5.

[8] K. Xiang, X. Hu, M. Yu, and X. Wang, “Exact and heuristic methods for a university course scheduling problem,” Expert Syst. Appl., vol. 248, p. 123383, 2024, doi: 10.1016/j.eswa.2024.123383.

[9] F. Dunke and S. Nickel, “A matheuristic for customized multi-level multi-criteria university timetabling,” Ann. Oper. Res., vol. 328, pp. 1313–1348, 2023, doi: 10.1007/s10479-023-05325-2.

[10] M. Davison, A. Kheiri, and K. G. Zografos, “Modelling and solving the university course timetabling problem with hybrid teaching considerations,” J. Sched., vol. 28, no. 2, pp. 195–215, 2025, doi: 10.1007/s10951-024-00817-w.

[11] E. Steiner, U. Pferschy, and A. Schaerf, “Curriculum-based university course timetabling considering individual course of studies,” Cent. Eur. J. Oper. Res., vol. 33, pp. 277–314, 2025, doi: 10.1007/s10100-024-00923-2.

[12] A. Rezaeipanah, S. S. Matoori, and G. Ahmadi, “A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search,” Appl. Intell., vol. 51, no. 1, pp. 467–492, 2021, doi: 10.1007/s10489-020-01833-x.

[13] T. Song, M. Chen, Y. Xu, D. Wang, X. Song, and X. Tang, “Competition-guided multi-neighborhood local search algorithm for the university course timetabling problem,” Appl. Soft Comput., vol. 110, p. 107624, 2021, doi: 10.1016/j.asoc.2021.107624.

[14] M. H. Cruz-Rosales et al., “Metaheuristic with Cooperative Processes for the University Course Timetabling Problem,” Appl. Sci., vol. 12, no. 2, p. 542, 2022, doi: 10.3390/app12020542.

[15] X. Han and D. Wang, “Gradual Optimization of University Course Scheduling Problem Using Genetic Algorithm and Dynamic Programming,” Algorithms, vol. 18, no. 3, p. 158, 2025, doi: 10.3390/a18030158.

[16] L. Yan and H. Deng, “Adaptive genetic algorithm for computer course scheduling system under the background of educational informatization,” Syst. Soft Comput., vol. 7, p. 200324, 2025, doi: 10.1016/j.sasc.2025.200324.

[17] K. Khaeroni, B. Muqdamien, and A. Hestiningtyas, “Towards Fair and Efficient Timetabling: A Genetic Algorithm Model Integrating Lecturer Day-Off Requests,” IJID (International J. Informatics Dev., vol. 14, no. 1, pp. 575–586, 2025, doi: 10.14421/ijid.2025.5067.

[18] R. W. Respati and D. Ramadhani, “Optimizing Lecture Scheduling Using Genetic Algorithm: A Case Study at Universitas Riau,” Int. J. Electr. Energy Power Syst. Eng., vol. 8, no. 2, pp. 220–232, 2025, doi: 10.31258/ijeepse.8.2.220-232.

[19] T. B. Pongsumarre, W. Wahyuni, and M. Fahmi, “Course Schedule Optimization Using a Java-Based Ant Colony Optimization,” Media J. Inform., vol. 17, no. 2, pp. 328–339, 2025, doi: 10.35194/mji.v17i2.5961.

[20] R. Salman, S. Suprapto, and Irfandi, “Pengaruh Probabilitas Crossover Terhadap Kinerja Algoritma Genetika Dalam Optimasi Penjadwalan Matakuliah,” J. Teknoif Tek. Inform. Inst. Teknol. Padang, vol. 11, no. 2, pp. 69–74, 2023, doi: 10.21063/jtif.2023.V11.2.69-74.

[21] B. S. G. López, R. A. G. Hernández, and Y. Ledeneva, “Personal Course Timetabling for University Students based on Genetic Algorithm,” Int. J. Comb. Optim. Probl. Informatics, vol. 12, no. 3, pp. 32–49, 2021, doi: 10.61467/2007.1558.2021.v12i3.237.

[22] A. R. Mahlous and H. Mahlous, “Student timetabling genetic algorithm accounting for student preferences,” PeerJ Comput. Sci., vol. 9, p. e1200, 2023, doi: 10.7717/peerj-cs.1200.

[23] N. M. Arratia-Martinez, C. Maya-Padron, and P. A. Avila-Torres, “University Course Timetabling Problem with Professor Assignment,” Math. Probl. Eng., vol. 2021, p. 6617177, 2021, doi: 10.1155/2021/6617177.

[24] M. Comlan and C. Allohoumbo, “Constraint satisfaction algorithms: edition of timetables in the license-master-doctorate system,” Comput. Sci. Inf. Technol., vol. 4, no. 3, pp. 217–226, 2023, doi: 10.11591/csit.v4i3.pp217-226.

[25] D. A. Salem, “University Examination Timetable Scheduling Using Constructive Heuristic Compared to Genetic Algorithm,” Fayoum Univ. J. Eng., vol. 6, no. 1, pp. 39–46, 2023, doi: 10.21608/FUJE.2022.157195.1018.

[26] I. A. Abduljabbar and S. M. Abdullah, “An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem,” Baghdad Sci. J., vol. 19, no. 2, pp. 399–408, 2022, doi: 10.21123/bsj.2022.19.2.0399.

[27] T. Müller, H. Rudová, and Z. Müllerová, “Real-world university course timetabling at the International Timetabling Competition 2019,” J. Sched., vol. 28, pp. 247–267, 2025, doi: 10.1007/s10951-023-00801-w.

[28] R. P. Badoni et al., “An Exploration and Exploitation-Based Metaheuristic Approach for University Course Timetabling Problems,” Axioms, vol. 12, no. 8, p. 720, 2023, doi: 10.3390/axioms12080720.

[29] H. P. Kurniawan, L. Farhatuaini, N. Bahiyah, A. Susanto, M. I. Wilsa, and G. K. Nufus, “Elite-Refined Genetic Algorithm with Hill Climbing Local Search for University Course Scheduling,” J. Sist. Cerdas, vol. 8, no. 3, pp. 317–331, 2025, doi: 10.37396/jsc.v8i3.584.

[30] O. Haitan and O. Nazarov, “Hybrid Approach to Solving of the Automated Timetabling Problem in Higher Educational Institution,” Syst. Control. Navig. Commun., vol. 2, no. 60, pp. 60–69, 2020, doi: 10.26906/SUNZ.2020.2.060.

Author Biographies

Sapriansyah, Department of Informatics Engineering, STMIK Widya Cipta Dharma, Indonesia

Author Origin : Indonesia

Heny Pratiwi, Department of Information Systems, STMIK Widya Cipta Dharma, Indonesia

Author Origin : Indonesia

Ahmad Fahrijal Pukeng, Department of Information Systems, STMIK Widya Cipta Dharma, Indonesia

Author Origin : Indonesia

Downloads

Download data is not yet available.

How to Cite

Sapriansyah, Heny Pratiwi, & Ahmad Fahrijal Pukeng. (2026). Automatic University Course Scheduling Using A Multi-Constraint Genetic Algorithm For Room and Time Optimization. International Journal of Science and Environment (IJSE), 6(4), 253–260. https://doi.org/10.51601/ijse.v6i4.810