Constraint-based time-tabling : a Case study

In this article we concentrate on a typical scheduling problem: the computation of a timetable for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from operations research and...

Full description

Saved in:
Bibliographic Details
Published in:Applied artificial intelligence 1996-09, Vol.10 (5), p.439-453
Main Authors: HENZ, M, WÜRTZ, J
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Scheduling, sequencing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article we concentrate on a typical scheduling problem: the computation of a timetable for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from operations research and traditional constraint logic programming are not able to express these constraints and search strategies on a sufficiently high level of abstraction. We show that the higher order concurrent constraint language Oz provides this high-level expressivity, and can serve as a useful programming tool for college time-tabling.
ISSN:0883-9514
1087-6545
DOI:10.1080/088395196118498