A survey of metaheuristic-based techniques for university timetabling problems
R Lewis - OR spectrum, 2008 - Springer
As well as nearly always belonging to the class of NP-complete problems, university
timetabling problems can be further complicated by the often idiosyncratic requirements …
timetabling problems can be further complicated by the often idiosyncratic requirements …
Experiences with IoT and AI in a smart campus for optimizing classroom usage
T Sutjarittham, HH Gharakheili… - IEEE Internet of …, 2019 - ieeexplore.ieee.org
Increasing demand for university education is putting pressure on campuses to make better
use of their real-estate resources. Evidence indicates that enrollments are rising, yet …
use of their real-estate resources. Evidence indicates that enrollments are rising, yet …
A harmony search algorithm for university course timetabling
MA Al-Betar, AT Khader - Annals of Operations Research, 2012 - Springer
One of the main challenges for university administration is building a timetable for course
sessions. This is not just about building a timetable that works, but building one that is as …
sessions. This is not just about building a timetable that works, but building one that is as …
A reinforcement learning: great-deluge hyper-heuristic for examination timetabling
Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …
An effective hybrid algorithm for university course timetabling
M Chiarandini, M Birattari, K Socha, O Rossi-Doria - Journal of Scheduling, 2006 - Springer
The university course timetabling problem is an optimisation problem in which a set of
events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of …
events has to be scheduled in timeslots and located in suitable rooms. Recently, a set of …
The university course timetabling problem with a three-phase approach
P Kostuch - International Conference on the Practice and Theory of …, 2004 - Springer
This paper describes the University Course Timetabling Problem (UCTP) used in the
International Timetabling Competition 2003 organized by the Metaheuristics Network and …
International Timetabling Competition 2003 organized by the Metaheuristics Network and …
[PDF][PDF] University Timetabling.
S Petrovic, EK Burke - 2004 - researchgate.net
University timetabling problems can be classified into two main categories: course and
examination timetabling. We discuss the problem statements and constraints for each of …
examination timetabling. We discuss the problem statements and constraints for each of …
Performance improvement strategies on Cuckoo Search algorithms for solving the university course timetabling problem
T Thepphakorn, P Pongcharoen - Expert Systems with Applications, 2020 - Elsevier
The university course timetabling problem (UCTP) arises every academic year and must be
solved by academic staff with/without a course timetabling tool. A Hybrid Self-adaptive …
solved by academic staff with/without a course timetabling tool. A Hybrid Self-adaptive …
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling
problems, for which many instances and results are available. In this work we design a …
problems, for which many instances and results are available. In this work we design a …
Solving the post enrolment course timetabling problem by ant colony optimization
C Nothegger, A Mayer, A Chwatal, GR Raidl - Annals of Operations …, 2012 - Springer
In this work we present a new approach to tackle the problem of Post Enrolment Course
Timetabling as specified for the International Timetabling Competition 2007 (ITC2007) …
Timetabling as specified for the International Timetabling Competition 2007 (ITC2007) …