IEOR4405, Spring 2005: Homework 4

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 the following instance of 3-partition:
   A={27,27,29,33,33,33,35,35,35,37,37,39}
   b=100
   
   • Formulate an instance of 1|r_j|L_max, using the reduction given in class.
   • Solve this instance of 1|r_j|L_max, any way you like.
   • What can you conclude about the 3-partition instance?
2. Prove that the problem P2||L_max is NP-complete. (Hint: reduce from partition).
3. Problem 3.8 (Solve using dynamic programming)
4. Problem 3.23
5. Extra Credit: Problem 3.26

Switch to:

• Homework 3
• Homework 5