| || || Chand, Atish|
| || || A constraint directed reasoning system for university timetabling|
Institution: University of the South Pacific.
Subject: Constraints (Artificial intelligence), Scheduling -- Data processing, Universities and colleges -- Timetables
Call No.: Pac Q 340 .C53 2005
Copyright:Over 80% of this thesis may be copied without the authors written permission
Abstract: Timetabling is a difficult NP-complete problem and belongs to a general class of problems known as scheduling. It has been difficult to develop a generic solution for timetabling due to a large variety of constraints typical in different timetabling environments. Additionally, it is difficult to compare timetabling algorithms due to the variety of constraints and data formats. Determining which timetabling resources and constraints are more constrained and restrictive than others is a universal problem. It is difficult to compare constraints and hence determine which constraints are more restrictive than others since the variety of constraints differ in nature. This thesis proposes a generic computational model for university timetabling for predefined constraints found in the problem, and a generic heuristic algorithm used to develop an acceptable solution. It shows that the reported wide variety of constraints can be modelled as smaller sets of constraints that can be easily compared with each other. A university examination timetabling problem is used to illustrate and test the model.