linear programming;
scheduling;
controllable processing time;
SINGLE-MACHINE;
D O I:
10.1109/CCCM.2009.5268146
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
In this paper we provide a linear programming relaxation algorithm for scheduling problem with controllable processing times. This problem is NP-hard even if there are no precedence constraints between the jobs. We prove that the performance ratio of the algorithm is 4.
机构:
Shenyang Normal Univ, Sch Math & Syst Sci, 253 Huanghei Northern St, Shenyang 110034, Peoples R ChinaShenyang Normal Univ, Sch Math & Syst Sci, 253 Huanghei Northern St, Shenyang 110034, Peoples R China
Luo, Chengxin
NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION,
2015,
5
(01):
: 71
-
77