IEOR4405, Spring 2019: Homework 2

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.1
2. Problem 3.3
3. Problem 3.15 (hint: use an exchange argument)
4. Problem 3.20
5. Consider the problem 1|| Σ w_j 2^C_j . Derive an optimal algorithm and show that it is optimal via an exchange argument
6. Extra Credit Write real code (e.g. C, C++, python or Java) for 1|chains|Σ w_jC_j (version 2 where you can interleave the chains). Your input is a set of n jobs, and for each job you have a weight w_j and a procesing time p_j. In addition you are given the list of chains. Your ouput should be the optimal schedule. (Output the C_j values.)

Switch to:

• IEOR4405, Spring 2019, Home Page
• Homework 1
• Homework 3