Please use this identifier to cite or link to this item:
Title: Constraint-based timetabling : a case study
Authors: Abbas, Abdulwahed
Tsang, Edward P.K
Affiliations: Department of Computer Science 
Keywords: Formal specification
Constraint theory
Educational administrative data processing
Program verification
Subjects: Operations research
Issue Date: 2003
Part of: Information & software technology journal
Start page: 359
End page: 372
This paper reports a case study in applying constraint satisfaction techniques to university and school timetabling. It involves the construction of a substantial, carefully specified, fully tested and fully operational system. The software engineering aspect of constraint satisfaction is emphasized. Constraint satisfaction problems are expressed in a language more familiar to the formal software engineering community. This brings constraint satisfaction one step closer to formal specification, program verification and transformation; issues extensively studied in software engineering. In problem formulation, explicit domain constraints and heuristic information are made explicit. Moreover, the user's needs are considered more closely; for instance, when the program fails to find a solution, useful indications are produced to help in relaxation or reformulation of the problem.
This is an extended version of a short paper presented at the AICCSA'2001.
Open URL: Link to full text
Type: Journal Article
Appears in Collections:Department of Computer Science

Show full item record

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.