Syllabus (Tentative)

Week Date Topics Reading HW assigned HW due
1 1/20, 1/22 Introduction, Administration, examples of scheduling problems, role of scheduling, classification of scheduling problems, complexity Chapters 1, 2 HW 1 -
2 1/27, 1/29 Single machine problems: simple dispatching rules Chapter 3 HW 2 HW 1
3 2/3, 2/5 Single machine problems: real-time scheduling, NP-hard scheduling problems, branch-and-bound Chapter 3, Appendix B, Appendix C HW 3 HW 2
4 2/10, 2/12 Single machine problems: NP-hard scheduling problems, dynamic programming, approximations HW 4 HW 3
5 2/17, 2/19 Parallel machine problems: minimizing schedule length Chapter 5 HW 5 HW 4
6 2/24, 2/26 Parallel machine problems: precedence constraints, heterogeneous environments HW 6 HW 5
7 3/2, 3/4 Parallel machine problems: average completion time Chapter 5 HW 6
8 3/9, 3/11 Project Scheduling, MIDTERM - - -
9 3/23, 3/25 Flow shop scheduling Chapter 6 HW 7 -
10 3/30, 4/1 Job shop scheduling Chapter 7 HW 8 HW 7
11 4/8 Lekin, Open shop sheduling, Scheduling in Transportation Chapter 7 , handout HW 9 HW 8
12 4/13, 4/15 Stochastic models Chapter 9 HW 10 HW 9
13 4/20, 4/22 stochastic scheduling, General Heuristics, Scheduling in Sports and Entertainment Chapter 10 HW 10
14 4/27,4/29 Student presentations - -
5/13, 9AM, 833 Mudd FINAL EXAM