Assigned:
Thursday, January 23, 2003
Due:
Thursday, January 30, 2003, 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 2.1. Please do not read ahead to Chapter 3 before doing
this problem. The purpose is to get you to try to figure out how to
solve this problem by yourself. The arguments for b and c should be
short and informal.
- Problem 2.2. Please do not read ahead to Chapter 3 before doing
this problem. The purpose is to get you to try to figure out how to
solve this problem by yourself. The arguments for b and c should be
short and informal.
- Problem 2.5. Again, do not read ahead, but come up with the best
schedule that you can.
- Problem 2.13. To show that the two problems are equivalent, argue that the optimal solution to the travelling salesman problem can be found by solving the scheduling problem, and visa versa.
Switch to:
cliff@ieor.columbia.edu