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 条
  • [41] Two-machine flow-shop scheduling to minimize total late work
    Lin, B. M. T.
    Lin, F. C.
    Lee, R. C. T.
    ENGINEERING OPTIMIZATION, 2006, 38 (04) : 501 - 509
  • [42] A note on "Two-machine flow-shop scheduling with rejection" and its link with flow-shop scheduling and common due date assignment
    T'kindt, V.
    Della Croce, F.
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (12) : 3244 - 3246
  • [43] Design and Analysis of Evolutionary Algorithms for the No-Wait Flow-Shop Scheduling Problem
    Czogalla, Jens
    Fink, Andreas
    METAHEURISTICS IN THE SERVICE INDUSTRY, 2009, 624 : 99 - 126
  • [44] Constructive heuristic algorithm for no-wait flow-shop scheduling with objective of makespan
    Hong Zong-you
    Pang Ha-li
    Proceedings of the 2007 Chinese Control and Decision Conference, 2007, : 901 - 904
  • [45] Minimizing tardiness in a two-machine flow-shop
    Pan, JCH
    Chen, JS
    Chao, CM
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) : 869 - 885
  • [46] Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
    Espinouse, ML
    Formanowicz, P
    Penz, B
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (01) : 116 - 121
  • [47] A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints
    Labidi, Mohamed
    Kooli, Anis
    Ladhari, Talel
    Gharbi, Anis
    Suryahatmaja, Umar S.
    IEEE ACCESS, 2018, 6 : 16294 - 16304
  • [48] A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS
    Gao, Kai-Zhou
    Pan, Quan-Ke
    Li, Jun-Qing
    Wang, Yu-Ting
    Liang, Jing
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2012, 29 (02)
  • [49] On Two-machine Flow Shop Scheduling
    Chen L.
    Luo W.-C.
    Zhang G.-C.
    Journal of the Operations Research Society of China, 2014, 2 (03) : 333 - 339
  • [50] Minimising mean tardiness with alternative operations in two-machine flow-shop scheduling
    Chen, JS
    Pan, JCH
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2005, 36 (12) : 757 - 766
12345