IEOR4405, Spring 2009: Homework 5

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.4
2. Problem 3.6 (please show your work for the branch and bound)
3. Problem 3.23
4. Read Section 3.3. and show the execution of the algorithm given there for 1||Σ U_j on the example from Exercise 3.8.
5. Consider the following instance of 1||Σ w_jU_j in which the jobs have a common deadline of 10.

   j	pj	wj
   1	3	2
   2	1	6
   3	7	9
   4	6	10

   Show the execution of the dynamic programming algorithm given in class (and for which c code is given on the course website)

Switch to:

• Homework 4
• Homework 6