Spring 2020

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
- Basic Notation (with notes)
- Basics of Algorithm Analysis
- Running times of various functions
- Running times of various functions (with notes)
- Simple Dispatch Rules
- Simple Dispatch Rules (with notes)
- Reductions
- Reductions (with notes)
- Some notes on NP-completeness.
- Some notes on NP-completeness. (with notes)
- A list of some NP-complete problems
- NP complete scheduling problems
- NP complete scheduling problems (with notes)
- Branch and bound for 1|r
_{j}| L_{max} - Branch and bound for 1|r
_{j}| L_{max}(with notes) - More Branch and bound for 1|r
_{j}| L_{max} - Minimizing late jobs
- Least Cost Last
- Parallel Machines - Makespan
- Parallel Machines - Makespan (with notes)
- Some notes on R|pmtn|C
_{ max }. - Some notes on R|pmtn|C
_{ max }(with notes) . - Parallel Machines - Average Completion Time
- Parallel Machines - Average Completion Time (with notes)
- Heuristics
- Heuristics (with notes)
- Project Scheduling
- Project Scheduling (with notes)
- Shop Scheduling
- Shop Scheduling (with notes)
- Permutation Flow Shop
- Permutation Flow Shop (with notes)
- Job Shop
- Job Shop
- Shifting Bottleneck
- Shifting Bottleneck
- Some Shop Scheduling Bounds
- Airline Scheduling
- Airline Scheduling
- Scheduling in Transportation
- Stochastic Scheduling
- Stochastic Scheduling

- Here are problems from a previous year's final