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 条
  • [1] An improved heuristic for no-wait flow shop to minimize makespan
    Ye, Honghan
    Li, Wei
    Abedini, Amin
    JOURNAL OF MANUFACTURING SYSTEMS, 2017, 44 : 273 - 279
  • [2] An effective and efficient heuristic for no-wait flow shop production to minimize total completion time
    Ye, Honghan
    Li, Wei
    Abedini, Amin
    Nault, Barrie
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 108 : 57 - 69
  • [3] An efficient method for no-wait flow shop scheduling to minimize makespan
    Li, Xiaoping
    Wang, Qian
    Wu, Cheng
    2006 10TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, PROCEEDINGS, VOLS 1 AND 2, 2006, : 1296 - 1301
  • [4] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Dipak Laha
    Uday K. Chakraborty
    The International Journal of Advanced Manufacturing Technology, 2009, 41 : 97 - 109
  • [5] A constructive heuristic for minimizing makespan in no-wait flow shop scheduling
    Laha, Dipak
    Chakraborty, Uday K.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (1-2): : 97 - 109
  • [6] A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN
    RAJENDRAN, C
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (04) : 472 - 478
  • [7] An Effective Meta-Heuristic for No-Wait Job Shops to Minimize Makespan
    Zhu, Jie
    Li, Xiaoping
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2012, 9 (01) : 189 - 198
  • [8] 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
  • [9] Heuristic for no-wait flow shops with makespan minimization
    Li, Xiaoping
    Wang, Qian
    Wu, Cheng
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (09) : 2519 - 2530
  • [10] A heuristic for no-wait flow shop scheduling
    Sagar U. Sapkal
    Dipak Laha
    The International Journal of Advanced Manufacturing Technology, 2013, 68 : 1327 - 1338
12345