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 条
  • [1] Approximative procedures for no-wait job shop scheduling
    Schuster, CJ
    Framinan, JM
    OPERATIONS RESEARCH LETTERS, 2003, 31 (04) : 308 - 318
  • [2] Job-shop scheduling with blocking and no-wait constraints
    Mascis, A
    Pacciarelli, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 143 (03) : 498 - 517
  • [3] On-line No-wait Job Shop Scheduling in Supply Chain
    Chang, Gui-Juan
    Xu, Jun-Qin
    Zhang, Ji-Hui
    2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 176 - +
  • [4] A hybrid genetic algorithm for no-wait job shop scheduling problems
    Pan, Jason Chao-Hsien
    Huang, Han-Chiang
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) : 5800 - 5806
  • [5] No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems
    Christoph J. Schuster
    Mathematical Methods of Operations Research, 2006, 63 : 473 - 491
  • [6] No-wait job shop scheduling: tabu search and complexity of subproblems
    Schuster, Christoph J.
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2006, 63 (03) : 473 - 491
  • [7] NEW RESULTS ON NO-WAIT FLOW-SHOP SCHEDULING
    AGNETIS, A
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1990, 143 : 436 - 445
  • [8] Approximability and in-approximability results for no-wait shop scheduling
    Sviridenko, M
    Woeginger, GJ
    41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 116 - 125
  • [9] Optimal job insertion in the no-wait job shop
    Reinhard Bürgy
    Heinz Gröflin
    Journal of Combinatorial Optimization, 2013, 26 : 345 - 371
  • [10] Optimal job insertion in the no-wait job shop
    Buergy, Reinhard
    Groeflin, Heinz
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 345 - 371
12345