ITEM VIEW

Constraint programming and university timetabling

dc.contributor.authorGroves, G. W.en_ZA
dc.contributor.authorVan Wijck, W.en_ZA
dc.date.accessioned2012-09-18T17:21:05Z
dc.date.available2012-09-18T17:21:05Z
dc.date.issued2002
dc.identifier.citationGroves, G. W. & Van Wijck, W. 2002. Constraint programming and university timetabling. South African Journal of Industrial Engineering, 13(1):1-12, doi:10.7166/13-1-314
dc.identifier.issn2224-7890 (online)
dc.identifier.issn1012-277X (print)
dc.identifier.otherdoi:10.7166/13-1-314
dc.identifier.urihttp://hdl.handle.net/10019.1/70436
dc.descriptionCITATION: Groves, G. W. & Van Wijck, W. 2002. Constraint programming and university timetabling. South African Journal of Industrial Engineering, 13(1):1-12, doi:10.7166/13-1-314.
dc.descriptionThe original publication is available at http://sajie.journals.ac.za
dc.description.abstractENGLISH 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.en_ZA
dc.description.abstractAFRIKAANSE OPSOMMING: 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.)Af_ZA
dc.description.urihttp://sajie.journals.ac.za/pub/article/view/314
dc.format.extent12 pagesen_ZA
dc.language.isoen_ZAen_ZA
dc.publisherSAIIEen_ZA
dc.subjectLogic programmingen_ZA
dc.subjectConstraint programming (Computer science)en_ZA
dc.subjectUniversities and colleges -- Timetablesen_ZA
dc.titleConstraint programming and university timetablingen_ZA
dc.typeArticleen_ZA
dc.rights.holderAuthors retain copyrighten_ZA


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

ITEM VIEW