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 条
  • [1] 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
  • [2] Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
    Chen, Rubing
    Yuan, Jinjiang
    [J]. DISCRETE APPLIED MATHEMATICS, 2021, 304 : 45 - 54
  • [3] Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
    Wan, Long
    Yuan, Jinjiang
    [J]. OPERATIONS RESEARCH LETTERS, 2013, 41 (04) : 363 - 365
  • [4] Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
    Gao, Yuan
    Yuan, Jinjiang
    [J]. OPERATIONS RESEARCH LETTERS, 2016, 44 (01) : 92 - 95
  • [5] Single-machine scheduling with deadlines to minimize the total weighted late work
    Chen, Rubing
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. NAVAL RESEARCH LOGISTICS, 2019, 66 (07) : 582 - 595
  • [6] Unary NP-hardness of minimizing the number of tardy jobs with deadlines
    Jinjiang Yuan
    [J]. Journal of Scheduling, 2017, 20 : 211 - 218
  • [7] Batch scheduling with learning effect on single-machine to minimize the total tardiness
    Hu, Jin-Chang
    Wu, Yao-Hua
    Wu, Ying-Ying
    Yang, Dong
    [J]. Kongzhi yu Juece/Control and Decision, 2019, 34 (12): : 2708 - 2712
  • [8] Unary NP-hardness of minimizing the number of tardy jobs with deadlines
    Yuan, Jinjiang
    [J]. JOURNAL OF SCHEDULING, 2017, 20 (02) : 211 - 218
  • [9] Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
    Dominik Kress
    Maksim Barketau
    Erwin Pesch
    [J]. Journal of Scheduling, 2018, 21 : 595 - 606
  • [10] Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
    Kress, Dominik
    Barketau, Maksim
    Pesch, Erwin
    [J]. JOURNAL OF SCHEDULING, 2018, 21 (06) : 595 - 606
12345