An Improved Genetic Algorithm Tool for Exam Timetabling Solutions

The timetabling problem is a well-known challenge in education management. It involves scheduling various events, such as classes, exams, and meetings, within limited time and resources. It requires carefully balancing numerous constraints and preferences, such as room availability, faculty availability, and student preferences. This problem is known as Non-deterministic Polynomial (NP). This paper used a new genetic algorithm, including encoded and fitness function techniques, to solve the faculty exam timetable problem. The tool's results were positive compared to similar findings from other studies. The outcomes also show how quickly the tool can produce more tables.