Instructor: Jay Sethuraman (Office hours: Fridays 10-12, and by appointment.)
TA: Chun Ye (Office hours: Wednesdays, 1:30-3:30 in 301 Mudd.)
Time/location: TR 11:40-12:55 PM in Mudd 535.
Course description: Scheduling concerns the allocation of limited resources to tasks over time. The resources and tasks may take many forms, ranging from scheduling computational threads on a network of workstations to assigning airline crews to various routes. 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 environment we will study a variety of scheduling problems and their solution.
Prerequisites: IEOR E3608/E4004 or equivalent; IEOR E3600/E4150 or equivalent.
Text: Scheduling: Theory, Algorithms, and Systems, Michael Pinedo, 4th edition (earlier editions are OK as well).
Course requirements: Problem sets (about 8-10) should be completed by all students. Each problem set will be assigned on a Thursday and is due the following Thursday, in class. Late submissions are not accepted except under extenuating circumstances, and should be discussed before the due-date. There will be a term project, assigned around the middle of the term, and due on the last day of classes. The project can be done by a group of 4-5 students. Each group should submit a short report (10 or so pages) and make a 15 minute presentation to the class.
Exams: The midterm exam will be held in class on Thursday, March 12th. The exam will cover all material taught in class up to and including the lecture on March 5th. You can bring one piece of paper (8.5 x 11) with writing on both sides. A sample exam will be posted shortly.
Grading: Problem sets (15%), Project (20%), Midterm (30%), Final (35%)
o Readings: Chapters 1 and 2 of the textbook
o Slides: overview, algorithm basics
o Readings: Chapter 3: 3.1, 3.2