Assigned:
Thursday, February 14, 2013
Due:
Thursday, February 21, 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.4
- Problem 3.6 (please show your work for the branch and bound)
- Problem 3.23
- Consider the following instance of 1||Σ wjUj in which the jobs have a common
deadline of 10.
| j | pj | wj
| | 1 | 1 | 6 |
| 2 | 2 | 4 |
| 3 | 5 | 8 |
| 4 | 3 | 6 |
| 5 | 6 | 9 |
Show the execution of the dynamic programming algorithm given in class.
- Give a dynamic programming algorithm for 1||Σ
wjUj in which the jobs have a common deadline in
which you fill in a table f(j,w), where f(j,w) is the minimum deadline d
by which you can schedule a subset of jobs 1..j and have that the weight of the jobs
finishing by time d is at least w. Be sure to give the recurrence and justify why it is correct.
Switch to:
cliff@ieor.columbia.edu