Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity

被引：0
|
作者：
Mikhail Y. Kovalyov
Dmitrij Šešok
机构：
[1] National Academy of Sciences of Belarus,United Institute of Informatics Problems
[2] Vilnius Gediminas Technical University,undefined
来源：
Journal of Scheduling | 2019年 / 22卷
关键词：
Scheduling; Batching; Agent scheduling; Computational complexity; Deterioration;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Tang et al. (Eur J Oper Res 263:401–411, 2017) have recently introduced a parallel-batching machine scheduling problem with linearly deteriorating jobs of two agents and presented a computational complexity classification of various special cases of this problem, including a number of NP-hardness proofs. We refine these results by demonstrating strong NP-hardness of several special cases, which are proved NP-hard in the ordinary sense in Tang et al. (Eur J Oper Res 263:401–411, 2017). Our reduction employs the problem studied in the first issue of Journal of Scheduling.
引用
收藏
页码：603 / 606
页数：3
相关论文
共 50 条
  • [31] The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan
    Nong, Qingqin
    Yuan, Jinjiang
    Fu, Ruyan
    Lin, Lin
    Tian, Ji
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 111 (02) : 435 - 440
  • [32] A note on the complexity of the problem of two-agent scheduling on a single machine
    Ng, C. T.
    Cheng, T. C. E.
    Yuan, J. J.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 12 (04) : 386 - 393
  • [33] A note on the complexity of the problem of two-agent scheduling on a single machine
    C. T. Ng
    T. C. E. Cheng
    J. J. Yuan
    Journal of Combinatorial Optimization, 2006, 12 : 387 - 394
  • [34] Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
    Shisheng Li
    Jinjiang Yuan
    Journal of Combinatorial Optimization, 2010, 19 : 84 - 93
  • [35] Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
    Li, Shisheng
    Yuan, Jinjiang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 19 (01) : 84 - 93
  • [36] Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue
    Pei, Jun
    Wang, Xingming
    Fan, Wenjuan
    Pardalos, Panos M.
    Liu, Xinbao
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2019, 70 (10) : 1830 - 1847
  • [37] A Two-Agent Single-Machine Scheduling Problem with Learning and Deteriorating Considerations
    Wu, Wen-Hsiang
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [38] The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
    Nong, Q. Q.
    Ng, C. T.
    Cheng, T. C. E.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 61 - 66
  • [39] A tabu method for a two-agent single-machine scheduling with deterioration jobs
    Wu, Wen-Hsiang
    Xu, Jianyou
    Wu, Wen-Hung
    Yin, Yunqiang
    Cheng, I-Fan
    Wu, Chin-Chia
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (08) : 2116 - 2127
  • [40] Two-agent scheduling with agent specific batches on an unbounded serial batching machine
    Mikhail Y. Kovalyov
    Ammar Oulamara
    Ameur Soukhal
    Journal of Scheduling, 2015, 18 : 423 - 434
12345