Assigned:
Thursday, February 3, 2005
Due:
Thursday, February 10, 2005, 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.6 (use branch and bound and show your work)
- Problem 3.7 (use branch and bound and show your work)
- Consider the following instance of 1||S
wjUj:
j | pj | w j | dj
| 1 | 1 | 3 | 7 |
2 | 2 | 2 | 7 |
3 | 4 | 1 | 7 |
4 | 5 | 5 | 7 |
Solve this problem using dynamic programming. Show the table that you
compute. (This problem is easy to solve by inspection. You must
solve it by dynamic programming for credit.)
- Problem 3.24
Switch to:
cliff@ieor.columbia.edu