Competitive analysis of preemptive single-machine scheduling

Research output: Contribution to JournalArticleAcademicpeer-review


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 languageEnglish
Pages (from-to)585-588
JournalOperations Research Letters
Publication statusPublished - 2010


Dive into the research topics of 'Competitive analysis of preemptive single-machine scheduling'. Together they form a unique fingerprint.

Cite this