Key research themes
1. How do metaheuristic algorithms, particularly genetic algorithms, enhance automated timetable generation under complex constraints?
This research area investigates the application and effectiveness of metaheuristic algorithms, especially genetic algorithms (GAs), in solving the NP-hard timetable generation problems. Given the combinatorial complexity and multiple hard and soft constraints inherent in academic timetabling, these algorithms provide heuristic or near-optimal solutions efficiently, overcoming limitations of exact methods. It matters due to the computational infeasibility of exhaustive search for real-world large-scale instances and the need for adaptable, scalable solutions in dynamic scheduling environments.
2. What are the roles and benefits of repair-based local search heuristics and constraint-based modeling in curriculum-based timetabling?
This research stream focuses on localized search techniques like repair-based heuristics combined with constraint satisfaction paradigms to construct solutions for curriculum-based timetabling problems, which commonly arise in university settings. These approaches are tailored to efficiently navigate vast combinatorial spaces by focusing on violated constraints, enabling domain-specific move generation and systematically improving feasibility and optimization objectives.
3. How can time and resource management innovations, including computer applications and process integration, improve scheduling efficiency and user experience in educational contexts?
This theme explores the development and deployment of software systems and digital tools to automate and enhance the usability, accuracy, and efficiency of timetable management. It also examines socio-technical aspects and organizational challenges in adopting these systems in educational institutions, with focus on user-friendly interfaces, staff collaboration, conflict resolution, and integration with institutional needs under digital and green transitions.





































