Linear Programming Relaxation Algorithm for Scheduling Problem with Controllable Processing Times

被引：1

作者：

Zhang, Feng ^{[1
]}

Liu, Lili ^{[1
]}

机构：

[1] Shanghai Second Polytech Univ, Sch Sci, Shanghai 201209, Peoples R China

来源：

2009 ISECS INTERNATIONAL COLLOQUIUM ON COMPUTING, COMMUNICATION, CONTROL, AND MANAGEMENT, VOL I | 2009年

关键词：

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.

引用

页码：82 / 85

页数：4

共 50 条

[1] Complexity of a scheduling problem with controllable processing times
Choi, Byung-Cheon
Leung, Joseph Y. -T.
Pinedo, Michael L.
OPERATIONS RESEARCH LETTERS, 2010, 38 (02) : 123 - 126
[2] Semi-definite relaxation algorithm for single machine scheduling with controllable processing times
Chen, F
Zhang, LS
CHINESE ANNALS OF MATHEMATICS SERIES B, 2005, 26 (01) : 153 - 158
[3] SEMI-DEFINITE RELAXATION ALGORITHM FOR SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES
CHEN FENG ZHANG LIANSHENG Department of Mathematics
ChineseAnnalsofMathematics, 2005, (01) : 153 - 158
[4] A linear time approximation scheme for the single machine scheduling problem with controllable processing times
Mastrolilli, M
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2006, 59 (01): : 37 - 52
[5] AN APPROXIMATION ALGORITHM FOR A SINGLE-MACHINE SCHEDULING PROBLEM WITH RELEASE TIMES, DELIVERY TIMES AND CONTROLLABLE PROCESSING TIMES
NOWICKI, E
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (01) : 74 - 81
[6] Flow-line scheduling problem with controllable processing times
Karabati, Selcuk
Kouvelis, Panagiotis
IIE Transactions (Institute of Industrial Engineers), 1997, 29 (01): : 1 - 14
[7] Flow-line scheduling problem with controllable processing times
Karabati, S
Kouvelis, P
IIE TRANSACTIONS, 1997, 29 (01) : 1 - 14
[8] A PTAS for the single machine scheduling problem with controllable processing times
Mastrolilli, M
ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 51 - 59
[9] A heuristic algorithm for master production scheduling problem with controllable processing times and scenario-based demands
Akhoondi, Fateme
Lotfi, M. M.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (12) : 3659 - 3676
[10] SCHEDULING JOBS WITH CONTROLLABLE PROCESSING TIMES AS AN OPTIMAL-CONTROL PROBLEM
NOWICKI, E
ZDRZALKA, S
INTERNATIONAL JOURNAL OF CONTROL, 1984, 39 (04) : 839 - 848

← 1 2 3 4 5 →