Assigned:
Thursday, February 19, 2004
Due:
Thursday, February 26, 2004, in class
General Instructions
- Please review the
course information.
- 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.
- Numbered problems are all from the textbook Scheduling:
Theory, Algorithms and Systems.
Problems
- Problem 5.1
- Problem 5.2
- Problem 5.11
- Problem 5.29 (You only need to prove that the approximation ratio is 2.)
- Extra credit: Suppose that you are given an
instance of P||Cmax in which there are only three distinct
values v1, v2, and v3 that processing times can attain. Give a polynomial time
algorithm for this problem, using dynamic programming.
Switch to:
cliff@ieor.columbia.edu