Competitive analysis of preemptive single-machine scheduling

被引:10
|
作者
Sitters, Rene [1 ]
机构
[1] Vrije Univ Amsterdam, Dept Econometr & Operat Res, Amsterdam, Netherlands
关键词
Scheduling; Competitive analysis; Online algorithms;
D O I
10.1016/j.orl.2010.08.012
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:585 / 588
页数:4
相关论文
共 50 条