Handouts
Natalia Shakhlevich (University of Leeds)
Handout 1: Introduction
Handout 2: Single Machine Problems: Total Completion Time
Handout 3: Single Machine Problems: Preemption
Handout 4: Single Machine Problems: Due Date Scheduling
Handout 5: Computational Complexity: Approximation Algorithm
Handout 6: Single Machine Problems: Branch and Bound Algorithm
Handout 7: Parallel Machines
Handout 8: Flow Shop
Handout 9: Heuristic Algorithms: Dispatching Rules
Handout 10: Heuristic Algorithms: Local Search
Handout 11: Job Shop
Handout 12: Genetic Algorithm