1887

n South African Journal of Industrial Engineering - Constraint programming and university timetabling

Volume 13, Issue 1
  • ISSN : 1012-277X
USD

 

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.

Hierdie artikel beskryf ?n familie van probleem-oplossingstegnieke bekend as ?Constraint Programming?, wat al hoe meer gebruik word om groot-skaalse industriële probleme op te los. Die nut van hierdie tegnieke word gedemonstreer deur die beskrywing van ?n skeduleringsisteem om die roosters vir ?n universiteit te genereer. Roosterskeduleringsprobleme is in praktiese gevalle NP-volledig en deel baie eienskappe met industriële skeduleringsprobleme. Die sisteem wat hier beskryf word maak gebruik van beide harde beperkings (wat altyd bevredig moet word) en sagte beperkings (bevrediging hiervan is wel voordelig maar dit is opsioneel.)

Loading full text...

Full text loading...

Loading

Article metrics loading...

/content/indeng/13/1/EJC46036
2002-01-01
2016-12-10

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error