|
Organizers |
An Heuristic Approach to Constraint Optimiziation in Examination Time Tabling.
by
Atish Chand
Dept of Mathematics and Computing Science, The University of The South Pacific
Timetabling belongs to the general class of problems known as scheduling. Due to the variety of constraints in different timetabling envornments, it has been difficult to develope a generic solution for timetabling. This paper attempts to define a generic standard for the defination of examination timetabling constraints, and proposes a heuristic method of developing a near optimal timetable.
Most of the known methods of optimizing contraints rely on a procedural method. This paper explores the declarative nature of structured query language, including relational algebra and relational calculus, in building a near optimal examination timetable.
Date received: October 12, 2001
Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cahf-27.