IEOR4405, Spring 2019: Homework 8

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 6.3
2. Problem 6.15
3. Consider F2|block|C_max and the following processing times

   job	1	2	3	4	5
   p1,j	3	8	5	2	10
   p2,j	5	4	1	2	7

   Formulate the corresponding TSP problem, solve it and then draw the Gantt chart for the resulting optimal schedule.
4. Turn in your two page status report (separately)

Switch to:

• Homework 7
• Homework 9