IEOR4405, Spring 2003: Homework 05

Assigned: Thursday, February 20, 2003
Due: Tuesday, February 27, 2003, in class

General Instructions

  1. 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.
  2. 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.29
  5. 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