Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines
Let there be m parallel machines and n jobs to be scheduled non-preemptively. A job j scheduled on machine i takes p_{i,j} time units to complete, where 1 ≤ i ≤ m and 1 ≤ j ≤ n. For a given schedule, the makespan is the completion time of a machine that finishes last. The goal is to produce a schedu...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1993/23825 |