A study on constructing an efficient examination scheduling system
Authors
-
Linh Nguyen Mai Vu
Ho Chi Minh City Open University, Ho Chi Minh City, Viet Nam
-
Hieu Chi Tran
Ho Chi Minh City Open University, Ho Chi Minh City, Viet Nam
-
Anh Thi Tram Nguyen
tramanh.nguyen@ou.edu.vn
Ho Chi Minh City Open University, Ho Chi Minh City, Viet Namhttps://orcid.org/0000-0001-9251-7848
DOI:
10.46223/HCMCOUJS.tech.en.14.1.2920.2024Keywords:
coloring; graph; scheduling problem; welsh-powellAbstract
The objective of this study is to investigate the final exam scheduling process at the Ho Chi Minh City Open University and develop an automated exam scheduling application. Our primary objectives are to prevent students from having conflicting exam schedules and to ensure that no student has to take more than two exams on the same day. This research focuses on applying graph coloring algorithms to the problem of automatic exam scheduling. Our research findings indicate that the graph coloring algorithm is highly effective for automated exam scheduling. This study has the potential to expand and support the development of an automatic exam scheduling and management system, in line with our overall goals. We conduct the experiments on the practical data at HCMCOU and obtain promising results.Downloads
Download data is not yet available.References
Adedayo, S., Esan, A., & Ajayi, S. (2023). Development of an automated timetable generator using genetic algorithm. Lautech Journal of Computing and Informatics, 3(1), 49-55.
Chengjun, S. (2016). On how to build a modern educational administration management platform in colleges and universities under the credit system. Proceedings of the 2016 6th International Conference on Management, Education, Information and Control (MEICI 2016), 633-636.
Dominic, J. A. W., & Martin, B. P. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1), 85-86.
Edmund, B. K., Patrick, C. D., Greet, B. V., & Hendrik, L. V. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(November 2004), 441-499.
Elmahdi, D., & Wessam, A. (2011). Efficient scheduling algorithms for multiantenna CDMA systems. IEEE Transactions on Vehicular Technology, 61(2), 521-532.
Ho Chi Minh City Open University. (n.d.). Retrieved May 10, 2023, from ou.edu.vn
Jacek, B., Jan, L. K., & AHG, K. R. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5(1), 11-24.
Michael, W. C., Gilbert, L., & Sau, L. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of The Operational Research Society, 47(3), 373-383.
Murat, D., & Hanefi, C. M. (2018). Solving the exam scheduling problems in central exams with genetic algorithms. Mugla Journal of Science and Technology, 4(1), 102-115.
Pellerin, R., Nathalie, P., & François, B. (2020). A survey of hybrid metaheuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 280(2), 395-416.
Runa, G., & Siddhartha, R. (2017). A study on course timetable scheduling using graph coloring approach. International Journal of Computational and Applied Mathematics, 12(2), 469-485.
Downloads
Received: 21-08-2023Accepted: 07-02-2024Published: 05-03-2024Statistics Views
Abstract: 589 PDF: 483How to Cite
Vu, L. N. M., Tran, H. C., & Nguyen, A. T. T. (2024). A study on constructing an efficient examination scheduling system. HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY, 14(1), 52–64. https://doi.org/10.46223/HCMCOUJS.tech.en.14.1.2920.2024License
Copyright (c) 2024 Linh Nguyen Mai Vu; Hieu Chi Tran; Anh Thi Tram Nguyen

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
