SMA Lectures on Constraint Programming
In February 2000, I gave three 1 1/2 hour lectures on
finite domain constraint programming as Guest Lecturer
of the
Singapore-MIT-Alliance.
The lectures were part of the course Systems Optimisation by
Robert Freund (MIT) and Teo Chung Piaw (NUS) in the programme
High Performance Computing for Engineered Systems
Spring 2000.
Overview and Material
-
An Overview of Finite Domain Constraint Programming
-
A second look at finite domain constraint programming
-
Slides: PPT
-
Further reading:
-
Scheduling with finite domain constraint programming
-
Slides: PPT
-
Further reading:
-
J. Carlier, E. Pinson: An algorithm for solving the job-shop problem.
Management Science, 35(2):164-176, 1989.
-
D. Applegate, W. Cook: A computational study of the job-shop
scheduling problem. Operations Research Society of America, Journal
on Computing, 3(2):149-156, 1991.
-
Y. Caseau, F. Laburthe: Improved CLP scheduling with task intervals.
In: Proceedings of the International Conference on Logic Programming,
pages 369-383. The MIT Prress, 1994.
Programs
The slides use the programming language OPL. The demos
shown in the class were programmed in the language Oz
using the Mozart system.
The Oz programs are available
online. Many of these programs
were written originally by Jörg Würtz,
Christian Schulte and Gert Smolka
as part of the
Mozart
documentation (see headers of source
programs). I modified them in order to make them fit
in the best way in the lecture. I thank Jörg,
Christian and Gert for letting me use them.
Download
For convenient downloading, a zipped file containing
the slides and programs is available
online.
Any feedback welcome!
© The copyright to this material is owned by
NUS
Author Martin Henz