Spring 2013

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.

- Lecture 1
- Basic Notation
- Basics of Algorithm Analysis
- Running times of various functions
- Simple Dispatch Rules
- Reductions
- Some notes on NP-completeness.
- A list of some NP-complete problems
- Branch and bound for 1|r
_{j}| L_{max} - Minimizing late jobs
- Least Cost Last
- Total Tardiness
- Parallel Machines - Makespan
- Some notes on R|pmtn|C
_{ max }. - Prallel Machines - Average Completion Time
- Project Scheduling
- Heuristics
- simulated annealing
- tabu search
- genetic algorithms
- Shop Scheduling
- Permutation Flow Shop
- Job Shop
- Shifting Bottleneck
- Some Shop Scheduling Bounds
- Airline Scheduling
- Scheduling in Transportation
- Stochastic Scheduling
- Gittins Index
- Energy in Scheduling
- Nuclear Weapons Scheduling
- DataCenter Scheduling