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 条
  • [41] Solving the no-wait job shop scheduling problem with due date constraints: A problem transformation approach
    Samarghandi, Hamed
    COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 136 : 635 - 662
  • [42] Combined Timetabling Procedure and Complete Local Search for No-Wait Job Shop Scheduling with Total Tardiness
    杨玉珍
    顾幸生
    Journal of Donghua University(English Edition), 2014, 31 (02) : 83 - 91
  • [43] An effective metaheuristic with adaptive delay active decoding for the no-wait job-shop scheduling problem
    Cui, Hanghao
    Li, Xinyu
    Yu, Yanbin
    Zhou, Wei
    Fu, Ling
    Xiang, Zhimou
    ENGINEERING OPTIMIZATION, 2024,
  • [44] The no-wait job shop with regular objective: a method based on optimal job insertion
    Reinhard Bürgy
    Heinz Gröflin
    Journal of Combinatorial Optimization, 2017, 33 : 977 - 1010
  • [45] The no-wait job shop with regular objective: a method based on optimal job insertion
    Burgy, Reinhard
    Groflin, Heinz
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (03) : 977 - 1010
  • [46] Scheduling a no-wait flow shop containing unbounded batching machines
    Oulamara, A
    Kovalyov, MY
    Finke, G
    IIE TRANSACTIONS, 2005, 37 (08) : 685 - 696
  • [47] An efficient method for no-wait flow shop scheduling to minimize makespan
    Li, Xiaoping
    Wang, Qian
    Wu, Cheng
    2006 10TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, PROCEEDINGS, VOLS 1 AND 2, 2006, : 1296 - 1301
  • [48] Single Hoist Scheduling in No-Wait Flexible Flow Shop System
    Wang Shilong
    Yao Wei
    Zhou Jie
    ISIP: 2009 INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING, PROCEEDINGS, 2009, : 381 - 386
  • [49] Comparison of Initial Solutions of Heuristics for No-wait Flow Shop Scheduling
    Sapkal, Sagar
    Laha, Dipak
    COMPUTATIONAL INTELLIGENCE AND INFORMATION TECHNOLOGY, 2011, 250 : 294 - 298
  • [50] No-wait Flow Shop Scheduling Based on Artificial Immune System
    Zhao, Xiaojuan
    Tang, Jun
    2ND IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER CONTROL (ICACC 2010), VOL. 3, 2010, : 436 - 440
12345