Computerised decision aid for timetabling: a case analysis
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem
Management Science
Graph coloring conditions for the existence of solutions to the timetable problem
Communications of the ACM
A Constraint-Based High School Scheduling System
IEEE Expert: Intelligent Systems and Their Applications
A survey of automated timetabling
A survey of automated timetabling
Tabu search techniques for large high-school timetabling problems
Tabu search techniques for large high-school timetabling problems
A Survey of Automated Timetabling
Artificial Intelligence Review
A Two Level Local Search for MAX-SAT Problems with Hard and Soft Constraints
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Scheduling and constraint propagation
Discrete Applied Mathematics
Speedup learning for repair-based search by identifying redundant steps
The Journal of Machine Learning Research
Anytime Learning of Decision Trees
The Journal of Machine Learning Research
Combining local search and look-ahead for scheduling and constraint satisfaction problems
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
An investigation of the course-section assignment problem
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
The Interleaved Constructive Memetic Algorithm and its application to timetabling
Computers and Operations Research
| Hi-index | 0.00 |
The high-school timetabling problem consists in assigning all the lectures of a high school to the time periods in such a way that no teacher (or class) is involved in more than one lecture at a time and other side constraints are satisfied. The problem is NP-complete and is usually tackled using heuristic methods. This paper describes a solution algorithm (and its implementation) based on Tabu Search. The algorithm interleaves different types of moves and makes use of an adaptive relaxation of the hard constraints. The implementation of the algorithm has been successfully experimented in some large high schools with various kinds of side constraints.