An effective heuristic for no-wait flow shop production to minimize makespan

被引：20
|
作者：
Ye, Honghan [1 ]
Li, Wei [1 ]
Miao, Enming [2 ]
机构：
[1] Univ Kentucky, Lexington, KY 40506 USA
[2] Hefei Univ Technol, Hefei, Peoples R China
来源：
JOURNAL OF MANUFACTURING SYSTEMS | 2016年 / 40卷
关键词：
Makespan minimization; No-wait flow shop; Heuristics; Computational complexity; TARDINESS MINIMIZATION; SCHEDULING PROBLEMS; SEQUENCING PROBLEM; FLOWSHOPS; ALGORITHMS; MACHINE;
D O I：
10.1016/j.jmsy.2016.05.001
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In no-wait flow shop production, each job must be processed without any interruption from its start time on the first machine to its completion time on the last machine. To minimize makespan in no-wait flow shop production is one of the main concerns in industry. In this paper, we propose an average departure time (ADT) heuristic for minimizing makespan in no-wait flow shop production. Based on the computational experiment with a large number of instances of various sizes, the ADT heuristic performs better than three existing best-known heuristics in the same computational complexity environment. (C) 2016 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码：2 / 7
页数：6
相关论文
共 50 条
  • [41] Meta-heuristic for no-wait job shops with makespan minimization
    Zhu, Jie
    Li, Xiaoping
    Zhang, Yi
    Wang, Qian
    PROCEEDINGS OF THE 2008 12TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOLS I AND II, 2008, : 874 - +
  • [42] A meta-heuristic approach for solving the no-wait flow-shop problem
    Samarghandi, Hamed
    ElMekkawy, Tarek Y.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (24) : 7313 - 7326
  • [43] 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 - +
  • [44] A High Quality Solution Constructive Heuristic for No-Wait Flow Shop Scheduling Problem
    Nagano, Marcelo Seido
    Miyata, Hugo Hissashi
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2016, 15 (03): : 206 - 214
  • [45] An effective genetic algorithm for flow shop scheduling problems to minimize makespan
    Robert, R. B. Jeen
    Rajkumar, R.
    MECHANIKA, 2017, 23 (04): : 594 - 603
  • [46] The no-wait flow-shop paradox
    Spieksma, FCR
    Woeginger, GJ
    OPERATIONS RESEARCH LETTERS, 2005, 33 (06) : 603 - 608
  • [47] Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
    Lin, BMT
    Cheng, TCE
    COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 613 - 624
  • [48] Hybrid heuristics based on harmony search to minimize total flow time in no-wait flow shop
    Gao, K. Z.
    Li, H.
    Pan, Q. K.
    Li, J. Q.
    Liang, J. J.
    2010 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-5, 2010, : 1184 - +
  • [49] Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability
    Espinouse, ML
    Formanowicz, P
    Penz, B
    COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) : 497 - 500
  • [50] Scheduling two-machine no-wait open shops to minimize makespan
    Liaw, CF
    Cheng, CY
    Chen, MC
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (04) : 901 - 917
12345