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 条
  • [11] Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
    Yang, Qi-Xia
    Liu, Long-Cheng
    Huang, Min
    Wang, Tian-Run
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 48 (01)
  • [12] NEW RESULTS ON NO-WAIT FLOW-SHOP SCHEDULING
    AGNETIS, A
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1990, 143 : 436 - 445
  • [13] A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
    Chuanli Zhao
    Hengyong Tang
    Optimization Letters, 2011, 5 : 183 - 190
  • [14] A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints
    Zhao, Chuanli
    Tang, Hengyong
    OPTIMIZATION LETTERS, 2011, 5 (01) : 183 - 190
  • [15] Heuristic algorithm for scheduling in the no-wait flow-shop
    Bertolissi, E
    JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2000, 107 (1-3) : 459 - 465
  • [16] Heuristic Algorithm Based on the Crucial Machine for the No-Wait Flow-Shop Scheduling
    Hong Zong-you
    Pang Ha-li
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 5121 - +
  • [17] Inverse scheduling: two-machine flow-shop problem
    Peter Brucker
    Natalia V. Shakhlevich
    Journal of Scheduling, 2011, 14 : 239 - 256
  • [18] A two-machine no-wait flow shop problem with two competing agents
    Abdennour Azerine
    Mourad Boudhar
    Djamal Rebaine
    Journal of Combinatorial Optimization, 2022, 43 : 168 - 199
  • [19] A two-machine no-wait flow shop problem with two competing agents
    Azerine, Abdennour
    Boudhar, Mourad
    Rebaine, Djamal
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (01) : 168 - 199
  • [20] Properties of two-machine no-wait flowshop scheduling problems
    Chen, Ke-Jia
    Wang, Xiao
    Kongzhi yu Juece/Control and Decision, 2013, 28 (10): : 1502 - 1506
12345