IEOR4405, Spring 2009: 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. Consider the scheduling problem 1||&Sigma C_j². Can you find an optimal algorithm for this problem? Is so, give a proof that is optimal.
3. Problem 3.15. Hint: use an exchange argument.
4. Write detailed pseudocode to implement the algorithm for 1|chains|&Sigma w_jC_j. 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.)