| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1142893 | Operations Research Letters | 2010 | 4 Pages |
Abstract
We give an online algorithm for minimizing the total weighted completion time on a single machine where preemption of jobs is allowed and prove that its competitive ratio is at most 1.57.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
René Sitters,