| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141570 | Discrete Optimization | 2009 | 15 Pages |
Abstract
We consider a problem of scheduling nn jobs on two uniform parallel machines. For each job we are given its release date when the job becomes available for processing. All jobs have equal processing requirements. Preemptions are allowed. The objective is to find a schedule minimizing total completion time. We suggest an O(n3)O(n3) algorithm to solve this problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Irina N. Lushchakova,