| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 480558 | European Journal of Operational Research | 2012 | 7 Pages |
Abstract
⺠Preemptive scheduling of n equal jobs on two uniform machines is considered. ⺠We suggest an O(n log n) algorithm to minimize total tardiness. ⺠The algorithm is based on the SPT-rule and uses the partial schedule transformations. ⺠We prove the theorem that justifies the algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Irina N. Lushchakova,