Tutorial CI-Sched 1:Constraint-based Scheduling
Wednesday, April 1, 4:30PM-6:30PM, Room: Hermitage B
Constraint satisfaction is a successful technology dealing with real-life combinatorial optimisation problems. This tutorial gives a brief introduction to constraint satisfaction techniques in general – the mainstream search and inference algorithms are presented.
The main part of the tutorial is focused on solving scheduling problems using constraint satisfaction techniques. Constraint models for scheduling problems will be described together with several inference and search techniques developed for these models.
IEEE SSCI 2009 March 30 – April 2, 2009 Sheraton Music City Hotel, Nashville, TN, USA