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 条
  • [31] Fitness landscape analysis for the no-wait flow-shop scheduling problem
    Czogalla, Jens
    Fink, Andreas
    JOURNAL OF HEURISTICS, 2012, 18 (01) : 25 - 51
  • [32] Fitness landscape analysis for the no-wait flow-shop scheduling problem
    Jens Czogalla
    Andreas Fink
    Journal of Heuristics, 2012, 18 : 25 - 51
  • [33] A DE-based approach to no-wait flow-shop scheduling
    Qian, B.
    Wang, L.
    Hu, R.
    Huang, D. X.
    Wang, X.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 57 (03) : 787 - 805
  • [34] Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
    Muthuswamy, Shanthi
    Velez-Gallego, Mario C.
    Maya, Jairo
    Rojas-Santiago, Miguel
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 63 (1-4): : 281 - 290
  • [35] A two-machine flow-shop scheduling with a deteriorating maintenance activity on the second machine
    Gara-Ali, Ahmed
    Espinouse, Marie-Laure
    2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM), 2015, : 481 - 488
  • [36] Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
    Shanthi Muthuswamy
    Mario C. Vélez-Gallego
    Jairo Maya
    Miguel Rojas-Santiago
    The International Journal of Advanced Manufacturing Technology, 2012, 63 : 281 - 290
  • [37] Schedule execution for two-machine flow-shop with interval processing times
    Matsveichuk, N. M.
    Sotskov, Yu. N.
    Egorova, N. G.
    Lai, T. -C.
    MATHEMATICAL AND COMPUTER MODELLING, 2009, 49 (5-6) : 991 - 1011
  • [38] Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph
    Cai, Yinhui
    Chen, Guangting
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Liu, Longcheng
    Zhang, An
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 205 - 217
  • [39] Two-machine flow-shop scheduling problem with weighted WIP costs
    Yang, J
    PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (12TH), VOLS 1- 3, 2005, : 592 - 597
  • [40] A heuristic for the two-machine no-wait openshop scheduling problem
    Sidney, JB
    Sriskandarajah, C
    NAVAL RESEARCH LOGISTICS, 1999, 46 (02) : 129 - 145
12345