Syllabus (Tentative)

Week Date Topics Reading HW assigned HW due
1 1/22 (no class 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 D, Appendix E HW 3 HW 2
4 2/10 2/12 Single machine problems: NP-hard scheduling problems, dynamic programming, approximations Chapter 3, Appendix B 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 Chapter 5 HW 6 HW 5
7 3/3 3/5 Parallel machine problems: average completion time Chapter 5 HW 6
8 3/10, 3/12 Project Scheduling, MIDTERM - - -
9 3/24, 3/26 Flow shop scheduling Chapter 6 HW 7 -
10 3/31, 4/2 Job shop scheduling Chapter 7 HW 8 HW 7
11 4/7 (no class 4/9) Lekin, Open shop sheduling, Scheduling in Transportation Chapter 7 , handout HW 9 HW 8
12 4/14, 4/16 Stochastic models Chapter 9, 10 HW 10 HW 9
13 4/21, 4/23 stochastic scheduling, General Heuristics Chapter 14, 15 HW 10
14 4/28, 4/30 Student presentations - -
Final 5/12, 9AM