IEOR4405, Spring 2019: Homework 5

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.23.
2. Problem 5.1.
3. Consider P||C_max. Give an example of a set of jobs and machines such that list scheduling (you choose the order of the list) gives a schedule that is close to 2 times the lower bound.
4. Consider P|r_j, prec|C_max. Show that the greedy algorithm is a 2-approximation.
5. Start thinking about who will be in your project group and what you will work on (no need to turn anything in this week).

Switch to:

• Homework 4
• Homework 6