IEOR4405, Spring 2016: 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. Consider the following instance of 1||Σ w_jU_j in which the jobs have a common deadline of 10.

   j	pj	wj
   1	1	3
   2	2	5
   3	5	12
   4	3	7
   5	3	10

   Show the execution of the dynamic programming algorithm given in class.
2. Give a dynamic programming algorithm for 1||Σ w_jU_j in which the jobs have a common deadline in which you fill in a table f(j,w), where f(j,w) is the minimum deadline d by which you can schedule a subset of jobs 1..j and have that the weight of the jobs finishing by time d is at least w. Be sure to give the recurrence and justify why it is correct.
3. Problem 5.1.
4. Problem 5.12

Switch to:

• Homework 4
• Homework 6