IEOR4405, Spring 2009: Homework 9

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 9.5
2. Problem 9.7
3. Problem 9.14
4. Problem 10.6
5. Consider the problem 1||Σ U_j , where you have three jobs. Each job has a processing time that is 3 with probability 1/3 and 6 with probability 2/3, and a deadline that is 4 with probability 1/2 and 10 with probability 1/2. Compute the expected value of Σ U_j for
   1. a static list policy
   2. a dynamic non-preemptive policy
   3. a dynamic preemptive policy

Switch to:

• Homework 8
• Homework 10