IE 661 Scheduling Theory (Fall 2003)
Assignment 2
Write about the complexity of Pm |
chain
| Cmax problem.
That is, is solving the
assignment
of operations to parallel machines when the
chain is provided, easy or hard?