IEOR4405, Spring 2013: Homework 10

Due: do not hand in

General Instructions

  1. 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||Σ Uj , 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 Σ Uj for
    1. a static list policy
    2. a dynamic non-preemptive policy
    3. a dynamic preemptive policy

Switch to:

cliff@ieor.columbia.edu