Exchanges procedures for timetabling problems

Agents in Timetabling Problems

Iterative restart technique for solving timetabling problems

Restart techniques for randomizing complete search algorithms were proposed recently by Gomes et al., for solving hard combinatorial problems. A new iterative algorithm that uses restart techniques is proposed, and its behavior analyzed on random timetabling problems. Employee timetabling problems (ETPs) can naturally represented by constraints networks for real world instances which are large ...

Local Search Techniques for Educational Timetabling Problems

Local Search is an emerging paradigm for combinatorial search, which has been recently shown to be very effective for a large number of combinatorial problems. Educational timetabling problems consist in scheduling a sequence of lectures or examinations between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. Problems in th...

Case-based Reasoning for Course Timetabling Problems

........................................................................................................7 Acknowledgements.......................................................................................9 Table of Content ...........................................................................................2 List of Figures................................................................

Similarity Measures for Exam Timetabling Problems

A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance or a small subset of instances related to a given real-life problem. Our aim is to develop a more general system which, when given any exam timetabl...