A (2+ε)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective

被引:6
|
作者
Sitters, Rene [1 ,2 ]
Yang, Liya [3 ]
机构
[1] Vrije Univ Amsterdam, NL-1081 HV Amsterdam, Netherlands
[2] CWI, NL-1098 XG Amsterdam, Netherlands
[3] East China Univ Sci & Technol, Shanghai 200237, Peoples R China
关键词
Scheduling; Approximation algorithm; Precedence constraints; Total weighted completion time;
D O I
10.1016/j.orl.2018.05.007
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We give a (2 + epsilon)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture on the approximability of this scheduling problem (Skutella, 2016). (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:438 / 442
页数:5
相关论文
共 50 条