IEOR4405, Spring 2017: Homework 6

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. Give an example for Q|pmtn|C_max on 4 machines with speeds 8, 5, 4, and 1 for which the optimal schedule needs to run the longest job on exactly 3 of the 4 machines.
2. Consider an instance of R|pmtn|C_max for which the amount of processing time for each job on each machine is :

   	J1	J2	J3	J4
   M1	5	3	0	0
   M2	0	5	4	1
   M3	3	2	2	5

   Show the execution of the algorithm given in class on this instance.
3. Problem 5.8
4. Problem 5.15

Switch to:

• Homework 5
• Homework 7