IEOR4405, Spring 2004: 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. Problem 3.5
2. Consider the following instance of 1||S w_jU_j:

   j	pj	w j	dj
   1	1	3	7
   2	2	2	7
   3	4	1	7
   4	5	5	7

   Solve this problem using dynamic programming. Show the table that you compute. (This problem is easy to solve by inspection. You must solve it by dynamic programming for credit.)
3. Problem 3.8 (Solve using dynamic programming)
4. Problem 3.23
5. Extra Credit: Problem 3.26

Switch to:

• Homework 3
• Homework 5