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. © 2010 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 585-588 |
Journal | Operations Research Letters |
Volume | 38 |
DOIs | |
Publication status | Published - 2010 |