Properties of two-machine no-wait flow-shop scheduling with a non-resumable unavailable interval

被引：3
|
作者：
Li D. [1 ]
Chen K. [1 ]
Wang X. [1 ]
机构：
[1] Department of Management Science and Engineering, Fuzhou University, Fuzhou
来源：
Chen, Kejia (kjchen@fzu.edu.cn) | 1600年 / Taylor and Francis Ltd.卷 / 34期
基金：
中国国家自然科学基金;
关键词：
complexity; no-wait; Two-machine flow-shop scheduling; unavailable interval; worst-case performance ratio;
D O I：
10.1080/21681015.2016.1271835
中图分类号：
学科分类号：
摘要：
The properties of two-machine no-wait flow-shop scheduling problem, with a non-resumable unavailable interval are studied. This research discusses two cases: a non-resumable unavailable interval in the first and second machines respectively. The problems’ complexities are proved to be NP-hard. The Gilmore and Gomory Algorithm (GGA) is applied to minimize the makespan, and the conditions that GGA yields the optimal solutions are presented. Sixty numerical examples with ten-job and two-machine are generated to test the proposed theorems. Compared to the results obtained by the Johnson algorithm, the GGA algorithm yields an 8.15% improvement on average. Moreover, the worst-case performance ratios of GGA are proved to be 2. © 2017 Chinese Institute of Industrial Engineers.
引用
收藏
页码：232 / 238
页数：6
相关论文
共 50 条
  • [21] Inverse scheduling: two-machine flow-shop problem
    Brucker, Peter
    Shakhlevich, Natalia V.
    JOURNAL OF SCHEDULING, 2011, 14 (03) : 239 - 256
  • [22] TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
    Ng, C. T.
    Matsveichuk, Natalja M.
    Sotskov, Yuri N.
    Cheng, T. C. Edwin
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2009, 26 (06) : 715 - 734
  • [23] Two-machine chain-reentrant flow shop with the no-wait constraint
    Amrouche, Karim
    Boudhar, Mourad
    Sami, Nazim
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2020, 14 (04) : 573 - 597
  • [24] Two-machine chain-reentrant flow shop with the no-wait constraint
    Amrouche K.
    Boudhar M.
    Sami N.
    Amrouche, Karim (amrouche-karim@hotmail.com), 1600, Inderscience Publishers (14): : 573 - 597
  • [25] 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
  • [26] New results on two-machine flow-shop scheduling with rejection
    Liqi Zhang
    Lingfa Lu
    Shisheng Li
    Journal of Combinatorial Optimization, 2016, 31 : 1493 - 1504
  • [27] New results on two-machine flow-shop scheduling with rejection
    Zhang, Liqi
    Lu, Lingfa
    Li, Shisheng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (04) : 1493 - 1504
  • [28] The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times
    Shabtay, Dvir
    Kaspi, Moshe
    Steiner, George
    IIE TRANSACTIONS, 2007, 39 (05) : 539 - 557
  • [29] Cyclic flow-shop scheduling with no-wait constraints and missing operations
    Smutnicki, Czeslaw
    Pempera, Jaroslaw
    Bocewicz, Grzegorz
    Banaszak, Zbigniew
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 302 (01) : 39 - 49
  • [30] A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
    Sidney, JB
    Potts, CN
    Sriskandarajah, C
    OPERATIONS RESEARCH LETTERS, 2000, 26 (04) : 165 - 173
12345