A Survey of Automated Timetabling
Artificial Intelligence Review
A Standard Data Format for Timetabling Instances
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A MAX-MIN Ant System for the University Course Timetabling Problem
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
An effective hybrid algorithm for university course timetabling
Journal of Scheduling
Design and Analysis of Experiments
Design and Analysis of Experiments
A Study on the Short-Term Prohibition Mechanisms in Tabu Search
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
The university course timetabling problem with a three-phase approach
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A multistage evolutionary algorithm for the timetable problem
IEEE Transactions on Evolutionary Computation
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
INFORMS Journal on Computing
The balanced academic curriculum problem revisited
Journal of Heuristics
Hi-index | 0.00 |
In this paper, we first discuss the level of compliance for timetabling research to two important research qualities, namely measurability and reproducibility, analyzing what we believe are the most important contributions in the literature. Secondly, we discuss some practices that, in our opinion, could contribute to the improvement on the two aforementioned qualities for future papers in timetabling research. For the sake of brevity, we restrict our scope to university timetabling problems (exams, courses, or events), and thus we leave out other equally important timetabling problems, such as high-school, employee, and transportation timetabling.