Assigned:
Thursday, April 1, 2004
Due:
Thursday, April 8, 2004, in class
General Instructions
- Please review the
course information.
- 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.
- Numbered problems are all from the textbook Scheduling:
Theory, Algorithms and Systems.
Problems
- Problem 6.2
- Problem 6.3
- Problem 6.18
- For the instance in Problem 6.9, find the optimal schedule. You do not
need to use Algorithm 4.5.5, but you do need to formulate this problem as a
travelling salesman problem.
- Problem 7.1
Switch to:
cliff@ieor.columbia.edu