CONSTRAINT PROGRAMMING AND UNIVERSITY TIMETABLING
ENGLISH ABSTRACT: The technology of Constraint Programming is rapidly becoming a popular alternative for solving large-scale industry problems. This paper provides an introduction to Constraint Programming and to Constraint Logic Programming (CLP), an enabler of constraint programming. The use of Constraint Logic Programming is demonstrated by describing a system developed for scheduling university timetables. Timetabling problems have a high degree of algorithmic complexity (they are usually NP-Complete), and share features with scheduling problems encountered in industry. The system allows the declaration of both hard requirements, which must always be satisfied, and soft constraints which need not be satisfied, though this would be an advantage.
AFRIKAANSE OPSOMMING: Hierdie artikel beskryf
How to Cite
LicenseAuthors who publish in the Journal agree to the following terms:
- Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.