Automated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Resource-Constrained Project Scheduling and Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
An application of genetic algorithms to the school timetabling problem
Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
Tabu search techniques for large high-school timetabling problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Feature selection in a fuzzy student sectioning algorithm
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Hi-index | 0.00 |
The high-school timetabling problem regards the weekly scheduling for all the lectures of a high school. The problem consists in assigning lectures to 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.