Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines

被引：0

作者：

Rubing Chen

Jinjiang Yuan

机构：

[1] Zhengzhou University,School of Mathematics and Statistics

来源：

Journal of Scheduling | 2019年 / 22卷

关键词：

Single-machine scheduling; Deadlines; Tardiness; Unary NP-hard;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We revisit the classical single-machine scheduling problem to minimize total tardiness with deadlines. The problem is binary NP-hard even without the deadline restrictions. It was reported early in Koulamas and Kyparisis (Eur J Oper Res 133:447–453, 2001) that the exact complexity (unary NP-hardness or pseudo-polynomial-time solvability) of the problem is still open. We show that this problem is unary NP-hard.

引用

页码：595 / 601

页数：6

共 50 条

[31] 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
[32] 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
[33] A SURVEY OF ALGORITHMS FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS SCHEDULING PROBLEM
ABDULRAZAQ, TS
POTTS, CN
VANWASSENHOVE, LN
[J]. DISCRETE APPLIED MATHEMATICS, 1990, 26 (2-3) : 235 - 253
[34] Simple heuristic to minimize total tardiness in a single machine scheduling problem
Panneerselvam, R.
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 30 (7-8): : 722 - 726
[35] 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
[36] Simple heuristic to minimize total tardiness in a single machine scheduling problem
R. Panneerselvam
[J]. The International Journal of Advanced Manufacturing Technology, 2006, 30 : 722 - 726
[37] Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
Gao, Yuan
Yuan, Jinjiang
[J]. DISCRETE APPLIED MATHEMATICS, 2015, 189 : 49 - 52
[38] Single-machine scheduling to minimize the maximum tardiness under piecewise linear deteriorating jobs
Jafari, A. A.
Lotfi, M. M.
[J]. SCIENTIA IRANICA, 2018, 25 (01) : 370 - 385
[39] Single machine group scheduling with family setups to minimize total tardiness
Gupta, Jatinder N. D.
Chantaravarapan, Samarn
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (06) : 1707 - 1722
[40] Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem
Ng, CT
Cheng, TCE
Yuan, JJ
[J]. INFORMATION PROCESSING LETTERS, 2002, 82 (04) : 187 - 191

← 1 2 3 4 5 →