CONSTRAINT PROGRAMMING AND UNIVERSITY TIMETABLING

Authors

  • G.W. Groves Department of Industrial Engineering, Stellenbosch University
  • W. Van Wijck Department of Industrial Engineering, Stellenbosch University

DOI:

https://doi.org/10.7166/13-1-314

Abstract

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

Downloads

Published

2011-11-05

How to Cite

Groves, G., & Van Wijck, W. (2011). CONSTRAINT PROGRAMMING AND UNIVERSITY TIMETABLING. The South African Journal of Industrial Engineering, 13(1). https://doi.org/10.7166/13-1-314

Issue

Section

General Articles