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 条
  • [31] An Effective Meta-Heuristic Algorithm to Minimize Makespan in Job Shop Scheduling
    Nazif, Habibeh
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2019, 18 (03): : 360 - 368
  • [32] Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms
    Shao, Weishi
    Pi, Dechang
    Shao, Zhongshi
    KNOWLEDGE-BASED SYSTEMS, 2017, 137 : 163 - 181
  • [33] An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Quan-Ke Pan
    Ling Wang
    Bao-Hua Zhao
    The International Journal of Advanced Manufacturing Technology, 2008, 38 : 778 - 786
  • [34] A genetic algorithm for Makespan minimization in a no-wait flow shop problem with two batching machines
    Jolai, F.
    Kor, H.
    Hatefi, S. M.
    Iranmanesh, H.
    2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND TECHNOLOGY, VOL II, PROCEEDINGS, 2009, : 238 - 242
  • [35] 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
  • [36] An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke
    Wang, Ling
    Zhao, Bao-Hua
    International Journal of Advanced Manufacturing Technology, 2008, 38 (7-8): : 778 - 786
  • [37] Minimising makespan in a no-wait flow shop with two batch processing machines: A grasp algorithm
    Maya, Jairo
    Muthuswamy, Shanthi
    Vélez-Gallego, Mario C.
    Rojas-Santiago, Miguel
    International Journal of Industrial and Systems Engineering, 2014, 17 (02) : 152 - 169
  • [38] 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
  • [39] An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion
    Pan, Quan-Ke
    Wang, Ling
    Zhao, Bao-Hua
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2008, 38 (7-8): : 778 - 786
  • [40] Some local search algorithms for no-wait flow-shop problem with makespan criterion
    Grabowski, J
    Pempera, J
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (08) : 2197 - 2212
12345