| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 482492 | European Journal of Operational Research | 2006 | 4 Pages |
Abstract
We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Chung-Lun Li,