Measurability and Reproducibility in Timetabling Research: State-of-the-Art and Discussion

In this paper, we first illustrate the state-of-the-art in timeta- bling research w.r.t. two important research qualities, namely measura- bility and reproducibility, analyzing what we believe are the most impor- tant 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 left out other equally- important timetabling problems, such as for example high-school, em- ployee, and transportation timetabling.

[1]  Steve Y. Chiu,et al.  Fine-tuning a tabu search algorithm with statistical tests , 1998 .

[2]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[3]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[4]  Jonathan M. Thompson,et al.  GRASPing the Examination Scheduling Problem , 2002, PATAT.

[5]  Jeffrey H. Kingston Modelling Timetabling Problems with STTL , 2000, PATAT.

[6]  Andrea Schaerf,et al.  A Survey of Automated Timetabling , 1999, Artificial Intelligence Review.

[7]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a Three-Phase Approach , 2004, PATAT.

[8]  Patrick De Causmaecker,et al.  Using Web Standards for Timetabling , 2002 .

[9]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

[10]  Mauro Birattari,et al.  The problem of tuning metaheuristics: as seen from the machine learning perspective , 2004 .

[11]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

[12]  Ben Paechter,et al.  A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem , 2002, PATAT.

[13]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[14]  Edmund K. Burke,et al.  A Standard Data Format for Timetabling Instances , 1997, PATAT.

[15]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[16]  Ender Özcan,et al.  Towards an XML-Based Standard for Timetabling Problems: TTML , 2005 .

[17]  Mauro Birattari,et al.  An effective hybrid approach for the university course timetabling problem , 2003 .

[18]  Edmund K. Burke,et al.  A multistage evolutionary algorithm for the timetable problem , 1999, IEEE Trans. Evol. Comput..

[19]  Luca Di Gaspero,et al.  Multi-neighbourhood Local Search with Application to Course Timetabling , 2002, PATAT.