CS410/510SS: Search and Scheduling
Winter 2000
This is the home page for the Winter 2000 offering of
CS410/510SS: Search and Scheduling. It is currently
being offered Tuesday evenings in
Lincoln Hall
Room 247.
A course syllabus is available.
For further information, please contact Bart Massey.
Papers
- James M. Crawford.
An Approach To Resource Constrained
Project Scheduling. [rcps]
- David E. Joslin and David P. Clements.
``Squeaky Wheel'' Optimization.
J. Art. Int. Res. 10(1999), pp. 353-373. [swo]
- Will Harvey and Matt Ginsberg. Limited Discrepancy
Search. Proc. IJCAI 1995
Homework
(Those experimenting with departmental computers must
follow the ``safety guidelines''.)
- Find A Scheduling Problem
- Brute Force Schedule Packing
- ``Intelligent'' Shift Packing
- Course Project
Lectures
- Introduction
- More About Search and Scheduling
- Systematic and Local Search Techniques
- Scheduling Spaces and Heuristics
- Realistic Scheduling Problems
- Case Study: The Aircraft Assembly Problem
At CIRL
- Case Study: Squeaky Wheel Optimization
Miscellaneous
Extra Credit
-
Some ``extra credit'' (as discussed in class, this
is a goodwill sort of thing rather than being worth
specific points) is available.
Weather
-
The CS dept. office has sent a message telling how to find
out about
weather-related
class cancellations.
Author: Bart Massey
<bart@cs.pdx.edu>
Last Updated: 2000/2/15