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 条
  • [31] No-wait flow shop scheduling with large lot sizes
    Alessandro Agnetis
    Annals of Operations Research, 1997, 70 : 415 - 438
  • [32] A Hybrid Intelligence Algorithm for No-wait Flow Shop Scheduling
    Wang Fang
    Rao Yun-qing
    Tang, Qiu-hua
    ADVANCES IN MANUFACTURING SCIENCE AND ENGINEERING, PTS 1-4, 2013, 712-715 : 2447 - +
  • [33] No-wait flow shop scheduling with large lot sizes
    Agnetis, A
    ANNALS OF OPERATIONS RESEARCH, 1997, 70 (0) : 415 - 438
  • [34] An Island Model for the No-Wait Flow Shop Scheduling Problem
    Istvan Borgulya
    PARALLEL PROBLEM SOLVING FROM NATURE-PPSN XI, PT II, 2010, 6239 : 280 - 289
  • [35] Variable neighborhood search for no-wait flow shop scheduling
    Liaocheng University, Liaocheng 252059, China
    不详
    Zhongguo Jixie Gongcheng, 2006, 16 (1741-1743):
  • [36] No-Wait Flexible Flow Shop Scheduling with Due Windows
    Huang, Rong-Hwa
    Yang, Chang-Lin
    Liu, Shang-Chia
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2015, 2015
  • [37] Heuristic algorithm for scheduling in the no-wait flow-shop
    Bertolissi, E
    JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2000, 107 (1-3) : 459 - 465
  • [38] A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
    Sundar, Shyam
    Suganthan, P. N.
    Jin, Chua Tay
    Xiang, Cai Tian
    Soon, Chong Chin
    SOFT COMPUTING, 2017, 21 (05) : 1193 - 1202
  • [39] A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint
    Shyam Sundar
    P. N. Suganthan
    Chua Tay Jin
    Cai Tian Xiang
    Chong Chin Soon
    Soft Computing, 2017, 21 : 1193 - 1202
  • [40] A Swarm Intelligence Approach to Flexible Job-Shop Scheduling Problem with No-Wait Constraint in Remanufacturing
    Sundar, Shyam
    Suganthan, P. N.
    Chua, T. J.
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II, 2013, 7895 : 593 - +
12345