Download PDF (external access)

International conference PATAT 2004, Date: 2004/08/18 - 2004/08/20, Location: Pittsburgh, USA

Publication date: 2005-01-01
Volume: 3616 Pages: 17 - 33
ISSN: 3-540-30705-2, 9783540307051
Publisher: Springer

Lecture Notes in Computer Science

Author:

Custers, Nele
De Causmaecker, Patrick ; Demeester, Peter ; Vanden Berghe, Greet

Keywords:

local-search, tabu search, framework, timetabling, ontology, Science & Technology, Technology, Computer Science, Artificial Intelligence, Computer Science, Theory & Methods, Computer Science, GENETIC ALGORITHM, LOCAL-SEARCH, CONSTRAINT LOGIC, TABU SEARCH, FRAMEWORK, COMPUTER

Abstract:

Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but they are nearly all designed to address specific problems. The framework presented in this paper is a step towards a generic semi-automatic timetabling tool. The basis of the framework is an ontology for timetabling that we designed after having investigated different types of timetabling problem.