
%0 Journal Article
%A Chand, A. 
%T A heuristic approach to constraint optimization in timetabling
%J The South Pacific Journal of Natural and Applied Sciences
%D 2002/12/15
%V 20
%N 1
%P 64-67
%K 
%R https://doi.org/10.1071/SP02013
%U https://www.publish.csiro.au/paper/SP02013 
%X Timetabling is a difficult (NP-complete) problem and belongs to a general class of problems known as scheduling. Due to a variety of constraints typical in different timetabling environments, it has been difficult to develop a generic solution for timetabling. This paper is an attempt to define a generic computational model for examination timetabling for predefined constraints found in the problem, and proposes a heuristic method of developing an acceptable solution. The declarative nature of the developed constraints language (based on the structured query language) is utilized to construct constraints and specify the timetabling problem as a constraint satisfaction problem. A university examination timetabling problem is used to illustrate and test the model. 
