Scheduling: Deterministic Models
Overview
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 study both algorithms for scheduling
problems, and scheduling problems that arise in the context of
industrial applications and large scale computing.
In the course of studying scheduling problems, we will have the
opportunity to study, in depth, many important algorithmic ideas, such
as randomized algorithms, approximation algorithms and linear
programming. We will emphasize the process of algorithm
design and will spend time in class posing problems,
and trying to solve them in a group or groups. We will cover both classical results in scheduling
and more recent developments.
There will be 3 or 4 problem sets and a final paper, project or presentation.
Information
Homework
Course Announcements