Assigned:
Thursday, January 31, 2013
Due:
Thursday, February 7, 2013, 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 3.1
- Problem 3.3
- Problem 3.15 (hint: use an exchange argument)
- Problem 3.17
- Problem 3.24 (hint: use an exchange argument)
- Extra Credit Write real code (C, C++, python or Java) for
1|chains|&Sigma wjCj. Your input is a set of n
jobs, and for each job you have a weight wj and a procesing time
pj. In addition you are given the list of chains. Your ouput
should be the optimal schedule. (Output the Cj values.)
Switch to:
cliff@ieor.columbia.edu