IEOR4405, Spring 2009: Homework 6

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. Problem 5.1
2. Problem 5.2
3. Problem 5.12
4. Problem 5.28 (You only need to prove that the approximation ratio is 2.)
5. Begin working on your initial project proposal (Will be discussed in class on Tuesday, due 3/12)
6. Extra credit: Suppose that you are given an instance of P||C_max in which there are only three distinct values v₁, v₂, and v₃ that processing times can attain. Give a polynomial time algorithm for this problem, using dynamic programming.

Switch to:

• Homework 5
• Homework 7