Scheduling concerns the allocation of limited resources to tasks over
time. The resources and tasks may take many forms, ranging from
scheduling computational threads on a network of workstations to
assigning airline crews to various routes.
This class will cover models and algorithms for scheduling problems.
We will cover a wide range of scheduling models including single machine,
multiple machine, shop environments. In each enviroment we will study
a variety of scheduling problems and their solution.
Midterm is on Thursday, 3/12. You can bring one 8.5 by 11 inch -->
piece of paper with writing on both sides. It will cover all material
covered up to and including lecture on 3/5. You can find the
problems from a previous year's midterm
Solution is here
- Here are problems from a previous year's final