Authors : Trinh Quang Minh; Ngo Thi Lan

Volume/Issue : Volume 11 - 2026, Issue 1 - January

Google Scholar : https://tinyurl.com/2u4my9c3

Scribd : https://tinyurl.com/2w3frd64

DOI : https://doi.org/10.38124/ijisrt/26jan518

Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.

Abstract : This paper presents the design and implementation process of an Exam Invigilation Scheduling Management System for lecturers at Tay Do University. The system automates the assignment of invigilators based on real-world data collected during the period 2021–2025. The core solution of the research is the combination of Graph Coloring algorithms to handle time conflicts and Greedy heuristics algorithms to ensure fairness in workload allocation. Exam sessions are modeled as nodes in the graph, where edges represent scheduling conflicts (matching dates and times). The system has been deployed on the Kaggle platform with interactive dashboards, allowing for transparent data analysis and visualization. Experimental results show that the system is capable of: Automatically detecting and eliminating 100% of scheduling conflicts between lecturers and exam rooms. Balancing workloads across departments helps reduce standard deviation in task allocation. Optimizing human resources through faculty rotation using modulo operations. Providing an intuitive query interface by date, class, or faculty member enhances educational management efficiency. This research contributes a data-driven approach, transitioning from manual management processes to intelligent automation systems, suitable for the practical context of Vietnamese universities.

Keywords : Greedy Algorithm, Graph Coloring Algorithm, Optimization, Scheduling, Invigilation, Data Visualization.

References :

1. Abdi, H. (2007). The greedy algorithm: An introduction. In N. J. Salkind (Ed.), Encyclopedia of Measurement and Statistics (pp. 414–417). Retrieved from SAGE Publications: https://books.google.com.vn/books/about/Encyclopedia_of_Measurement_and_Statisti.html?id=dqc5DQAAQBAJ
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.). Retrieved from MIT Press: https://archive.org/details/introduction-to-algorithms-third-edition-2009/
3. Pandas Development Team. (2023). pandas: Powerful Python data analysis toolkit. Retrieved from pandas: https://pandas.pydata.org
4. Gradio Team. (2023). Gradio: Build machine learning web apps in Python. Retrieved from Gradio: https://gradio.app
5. Kaggle. (2023). Kaggle: Your machine learning and data science community. Retrieved from Kaggle: https://www.kaggle.com
6. Welsh, D. J. A., & Powell, M. B. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. Retrieved from The Computer Journal: https://academic.oup.com/comjnl/article-abstract/10/1/85/376064
7. Wren, A. (1996). Scheduling, timetabling and rostering — A special relationship? In E. K. Burke & P. Ross (Eds.), Practice and theory of automated timetabling (pp. 46–75). Retrieved from Springer: https://link.springer.com/chapter/10.1007/3-540-61794-9_51
8. Trịnh, Q. M. (2025). Hệ thống quản lý lịch gác thi của giảng viên Trường Đại học Tây Đô [Kaggle code repository]. Retrieved from Kaggle: https://www.kaggle.com/code/trnhquangminh140/h-th-ng-qu-n-l-l-ch-g-c-thi-tr-nh-quang-minh
9. Akbulut, A., & Yılmaz, G. (2015). University Exam Scheduling System Using Graph Coloring Algorithm and RFID Technology. International Journal of Innovation, Management and Technology. Retrieved from: https://www.ijimt.org/papers/359-D0129.pdf
10. Barone, M., Naeem, M., Ciaschi, M., Tretola, G., & Coronato, A. (2025). AI-Based Intelligent System for Personalized Examination Scheduling. Technologies, 13(11), 518. MDPI. Retrieved from: https://www.mdpi.com/2227-7080/13/11/518
11. Ye, T., Jovine, A. S., van Osselaer, W., Zhu, Q., & Shmoys, D. B. (2024). Cornell University Uses Integer Programming to Optimize Final Exam Scheduling. arXiv preprint. Retrieved from: https://arxiv.org/pdf/2409.04959
12. Hussin, B., Basari, A. S. H., Shibghatullah, A. S., & Asmai, S. A. (2010). Exam Timetabling Using Graph Colouring Approach. Universiti Teknikal Malaysia Melaka. Retrieved from: https://files01.core.ac.uk/download/235629014.pdf
13. (2021). Modelling and Optimization of the Exam Invigilator Assignment Problem Based on Preferences. Academia.edu. . Retrieved from: https://www.academia.edu/68798359/Modelling_and_Optimization_of_the_Exam_Invigilator_Assignment_Problem_Based_on_Preferences (academia.edu)