IEOR4405, Spring 2019: Homework 7

General Instructions

1. Please review the course information.
2. You must write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.
3. Numbered problems are all from the textbook Scheduling: Theory, Algorithms and Systems.

Problems

1. Consider a Q|pmtn|ΣC_j problem where the machine speeds are (4,2,2,1) and the processing times are (4,8,18,19,21,32,42). Show the optimal schedule.
2. Consider the project scheduling problem given in the notes, where we were interested in the time-cost tradeoff. Start where the example in class ended, and run three more iterations, showing the cheapest way to decrease the project length by one time unit each time.
3. Problem 6.1
4. Problem 6.2
5. Problem 6.12

Switch to:

• Homework 6
• Homework 8