Inapproximability results for no-wait job shop scheduling

被引：18
|
作者：
Woeginger, GJ [1 ]
机构：
[1] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
来源：
OPERATIONS RESEARCH LETTERS | 2004年 / 32卷 / 04期
关键词：
approximation algorithms; APX hardness; shop scheduling;
D O I：
10.1016/j.orl.2003.10.003
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We investigate the approximability of the no-wait job shop scheduling problem under the makespan criterion. We show that this problem is APX-hard (i) for the case of two machines with at most five operations per job, and (ii) for the case of three machines with at most three operations per job. Hence, these problems do not possess a polynomial time approximation scheme, unless P = NP. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码：320 / 325
页数：6
相关论文
共 50 条
  • [21] A Radial Memetic Algorithm to Resolve the No-Wait Job-Shop Scheduling Problem
    Perez-Rodriguez, Ricardo
    MATHEMATICS, 2024, 12 (21)
  • [22] Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints
    Romanova A.A.
    Servakh V.V.
    Journal of Applied and Industrial Mathematics, 2019, 13 (04): : 706 - 716
  • [23] Modeling and scheduling no-wait open shop problems
    Naderi, B.
    Zandieh, M.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 158 : 256 - 266
  • [24] A composite heuristic for the no-wait flow shop scheduling
    Gao Kaizhou
    Suganthan, P. N.
    Bao Zhenqiang
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [25] New controllable processing time scheduling with subcontracting strategy for no-wait job shop problem
    Gao, Jinsheng
    Zhu, Xiaomin
    Bai, Kaiyuan
    Zhang, Runtong
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2022, 60 (07) : 2254 - 2274
  • [26] No-Wait Job Shop Scheduling Using a Population-Based Iterated Greedy Algorithm
    Xu, Mingming
    Zhang, Shuning
    Deng, Guanlong
    ALGORITHMS, 2021, 14 (05)
  • [27] A polynomial algorithm for a two-machine no-wait job-shop scheduling problem
    Kravchenko, SA
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (01) : 101 - 107
  • [28] An Enhanced Estimation of Distribution Algorithm for No-Wait Job Shop Scheduling Problem with Makespan Criterion
    Chen, Shao-Feng
    Qian, Bin
    Hu, Rong
    Li, Zuo-Cheng
    INTELLIGENT COMPUTING METHODOLOGIES, 2014, 8589 : 675 - 685
  • [29] Algorithm Based on K-Neighborhood Search for No-wait Job Shop Scheduling Problems
    Wang, Yong Ming
    Yin, Hong Li
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 4221 - 4225
  • [30] Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model
    Liu, Shi Qiang
    Kozan, Erhan
    TRANSPORTATION SCIENCE, 2011, 45 (02) : 175 - 198
12345