@inproceedings{f868551a472e4db8b56861d2295db49b,
title = "A heuristic incremental modeling approach to course timetabling",
abstract = "The general timetabling problem is an assignment of activities to fixed time intervals, adhering to a predefined set of resource availabilities. Timetabling problems are difficult to solve and can be extremely time-consuming without some computer assistance. In this paper the application of constraint-based reasoning to timetable generation is examined. Specifically, we consider how a timetabling problem can be represented as a Constraint Satisfaction Problem (CSP), and propose an algorithm for its solution which improves upon the basic idea of backtracking. Normally, when a backtracking routine fails to find a solution, there is nothing of value returned to the user; however, our algorithm extends this process by iteratively adding constraints to the CSP representation. A generalized random model of timetabling problems is proposed. This model creates a diverse range of problem instances, which are used to verify our search algorithm and identify the characteristics of difficult timetabling problems.",
author = "Don Banks and \{Van Beek\}, Peter and Amnon Meisels",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1998.; 12th Biennial Conference on Artificial Intelligence, AI 1998 ; Conference date: 18-06-1998 Through 20-06-1998",
year = "1998",
month = jan,
day = "1",
doi = "10.1007/3-540-64575-6\_37",
language = "English",
isbn = "3540645756",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "16--29",
editor = "Mercer, \{Robert E.\} and \{Neufeld \}, Eric",
booktitle = "Advances in Artificial Intelligence - 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 1998, Proceedings",
address = "Germany",
}