Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines

被引：0
|
作者：
Chen, Rubing [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2021年 / 304卷
基金：
中国国家自然科学基金;
关键词：
Preemptive scheduling; Release time; Deadlines; Total completion time; Unary NP-hard; OPTIMALITY; PROOF; DATES;
D O I：
10.1016/j.dam.2021.07.031
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We revisit the single-machine preemptive scheduling problem to minimize total completion time with release times and deadlines. Du and Leung (1993) showed that the problem is binary NP-hard. But the exact complexity (unary NP-hardness or pseudo-polynomial-time solvability) of the problem is a long standing open problem. We show in this paper that the problem is unary NP-hard. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：45 / 54
页数：10
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
    Yuan, J. J.
    Cheng, T. C. E.
    Ng, C. T.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (02) : 631 - 633
  • [4] Unary NP-hardness of minimizing the number of tardy jobs with deadlines
    Jinjiang Yuan
    [J]. Journal of Scheduling, 2017, 20 : 211 - 218
  • [5] Unary NP-hardness of minimizing the number of tardy jobs with deadlines
    Yuan, Jinjiang
    [J]. JOURNAL OF SCHEDULING, 2017, 20 (02) : 211 - 218
  • [6] A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
    Wan, Long
    Yuan, Jinjiang
    Geng, Zhichao
    [J]. JOURNAL OF SCHEDULING, 2015, 18 (03) : 315 - 323
  • [7] A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
    Long Wan
    Jinjiang Yuan
    Zhichao Geng
    [J]. Journal of Scheduling, 2015, 18 : 315 - 323
  • [8] On the NP-hardness of scheduling with time restrictions
    Zhang, An
    Chen, Yong
    Chen, Lin
    Chen, Guangting
    [J]. DISCRETE OPTIMIZATION, 2018, 28 : 54 - 62
  • [9] Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times
    Guoqing Wang
    Hongyi Sun
    Chengbin Chu
    [J]. Annals of Operations Research, 2005, 133 : 183 - 192
  • [10] Preemptive scheduling with availability constraints to minimize total weighted completion times
    Wang, GQ
    Sun, HY
    Chu, CB
    [J]. ANNALS OF OPERATIONS RESEARCH, 2005, 133 (1-4) : 183 - 192
12345