| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143358 | Operations Research Letters | 2010 | 4 Pages |
Abstract
We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger,