Slides From Academia

1. Julius Atlason (University of Michigan)
 
Homeworks
#1, #2, #3, #4, #5, #6, #7, #8, #9, #10, #11
 
Powerpoint Slides
Introduction
Chapter 3: Single Machine Models (3.1-3.2)
Chapter 3: Single Machine Models (3.3-3.5)
Chapter 5: Parallel Machine Models (5.1-5.2)
Chapter 5: Parallel Machine Models (5.3-5.6)
Chapter 6: Flow Shops
Chapter 7: Job Shops
Chapter 8: Open Shops
Chapter 9: Stochastic Model--Preliminaries
Chapter 10: Single Machine Stochastic Models
Chapter 11: Stochastic Single Machine Models with Release Dates
Chapter 14: General Purpose Procedures for Scheduling in Practice (14.1-14.3)
Chapter 14: General Purpose Procedures for Scheduling in Practice (14.4)
Chapter 14: General Purpose Procedures for Scheduling in Practice (14.5)
 

2. Johann Hurink (University of Twente, The Netherlands)
 
Exercises
#1, #2
 
PDF Slides
1. Scheduling (LNMB Master Course)
2. Classification
3. Single Machine Models: Maximum Lateness
4. Single Machine Models: Number of Tardy Jobs
5. Parallel Machine Models
6. Shop Models
7. Open Shop Models
8. Shifting Bottleneck Heuristic for Job Shop
9. Service Models
10. Transportation Models
11. On-Line Scheduling

 

3. Rakesh Nagi (University at Buffalo)
 
Course Introduction
Chapter 1. Introduction
Chapter 2. Deterministic Models Preliminaries
Chapter 3
Chapter 4. More Advanced Single Machine Models
Chapter 5. Parallel Machine Models
Chapter 6. Flow Shops & Flexible Flow Shops
Complexity Theory
 

4. Tim Nieberg (University of Bonn)
 
1. Scheduling

2. Single Machine Scheduling

3. Recap: Complexity Theory

4. Parallel Machine Scheduling
5. Shop Scheduling
6. Interval Scheduling, Reservations and Timetabling
7. Models in Transportation
8. Metaheuristics in Scheduling: Local Search and Genetic Algorithms
9. Online Algorithms

 

5. Uwe Schwiegelshohn (CEI University Dortmund)
 
1. Summer 2003

2. Summer 2004 (PDF)

3. Summer 2004 (PPT)

 

6. Natalia Shaklevich (University of Leeds)
 
Job Shop

Local Search

1. Introduction

2. Single Machine Problems: Total Completion Time
3. Single Machine Problems: Due Date Scheduling
4. Computational Complexity
5. Single Machine Problem: Branch and Bound Algorithm
6. Parallel Machine Problems
7. Flow Shop
8. Types of Algorithms. Dispatching Rules
9. Local Search
10. Genetic Algorithm
11. Job Shop Problem: Branch and Bound Algorithm