| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 709769 | IFAC Proceedings Volumes | 2012 | 5 Pages |
Abstract
We propose a polynomial-time algorithm that solves the problem of scheduling jobs with two possible processing times on unrelated machines with the objective to minimize the maximal job completion time.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
