Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard

被引：36

作者：

Wan, Long ^{[1
]}

Yuan, Jinjiang ^{[1
]}

机构：

[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China

来源：

OPERATIONS RESEARCH LETTERS | 2013年 / 41卷 / 04期

关键词：

Single machine; Earliness; Tardiness; NP-hard; SYMMETRIC EARLINESS; COMPLETION TIMES; PENALTIES; DEVIATION; COMMON; DATE;

D O I：

10.1016/j.orl.2013.04.007

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper revisits the classic single-machine scheduling to minimize the total earliness and tardiness. It is known that the problem is NP-hard in the ordinary sense, but the exact complexity of the problem is long-standing open. We show in this paper that this problem is strongly NP-hard. (C) 2013 Published by Elsevier B.V.

引用

页码：363 / 365

页数：3

共 50 条

[1] A special case of the single-machine total tardiness problem is NP-hard
Gafarov, E. R.
Lazarev, A. A.
[J]. JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2006, 45 (03) : 450 - 458
[2] A special case of the single-machine total tardiness problem is NP-hard
E. R. Gafarov
A. A. Lazarev
[J]. Journal of Computer and Systems Sciences International, 2006, 45 : 450 - 458
[3] Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Rubing Chen
Jinjiang Yuan
[J]. Journal of Scheduling, 2019, 22 : 595 - 601
[4] Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Chen, Rubing
Yuan, Jinjiang
[J]. JOURNAL OF SCHEDULING, 2019, 22 (05) : 595 - 601
[5] Single machine scheduling with family setups to minimize total earliness and tardiness
Schaller, Jeffrey E.
Gupta, Jatinder N. D.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) : 1050 - 1068
[6] Single-machine common due date total earliness/tardiness scheduling with machine unavailability
Bulbul, Kerem
Kedad-Sidhoum, Safia
Sen, Halil
[J]. JOURNAL OF SCHEDULING, 2019, 22 (05) : 543 - 565
[7] OPTIMAL SINGLE-MACHINE SCHEDULING WITH EARLINESS AND TARDINESS PENALTIES
LAKSHMINARAYAN, S
LAKSHMANAN, R
PAPINEAU, RL
ROCHETTE, R
[J]. OPERATIONS RESEARCH, 1978, 26 (06) : 1079 - 1082
[8] OPTIMAL SINGLE-MACHINE SCHEDULING WITH EARLINESS AND TARDINESS PENALTIES
SIDNEY, JB
[J]. OPERATIONS RESEARCH, 1977, 25 (01) : 62 - 69
[9] Single machine scheduling with controllable processing times to minimize total tardiness and earliness
Kayvanfar, Vahid
Mahdavi, Iraj
Komaki, Gh. M.
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2013, 65 (01) : 166 - 175
[10] MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD
DU, JZ
LEUNG, JYT
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) : 483 - 495

← 1 2 3 4 5 →