Some heuristics for no-wait flowshops with total tardiness criterion

被引：28
|
作者：
Liu, Gengcheng [1 ]
Song, Shiji [1 ]
Wu, Cheng [1 ]
机构：
[1] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
来源：
COMPUTERS & OPERATIONS RESEARCH | 2013年 / 40卷 / 02期
基金：
中国国家自然科学基金;
关键词：
No-wait flowshop; Heuristic; Total tardiness; PERMUTATION FLOW SHOPS; SCHEDULING PROBLEMS; MAXIMUM LATENESS; MAKESPAN; ALGORITHM; MACHINE; MINIMIZATION; BICRITERIA; BLOCKING; SEARCH;
D O I：
10.1016/j.cor.2012.07.019
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
No-wait flowshop scheduling problem is widely investigated because of its practical application and specific properties. However, the total tardiness criterion has not been much considered. In this paper, we propose six heuristic approaches for no-wait flowshops with total tardiness criterion, among which the modified NEH algorithm (MNEH) is verified to be the best. Also, a speed-up technique is introduced to MNEH to reduce the computational time in certain cases. By numeral experiments and analysis, we evaluate the performances of various heuristics. Finally we find out that MNEH is a satisfactory algorithm dealing with this problem. (c) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码：521 / 525
页数：5
相关论文
共 50 条
  • [1] MINIMIZING TOTAL TARDINESS IN NO-WAIT FLOWSHOPS
    Aldowaisan, Tariq
    Allahverdi, Ali
    [J]. FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2012, 37 (03) : 149 - 162
  • [2] Accelerated methods for total tardiness minimisation in no-wait flowshops
    Ding, Jianya
    Song, Shiji
    Zhang, Rui
    Gupta, Jatinder N. D.
    Wu, Cheng
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (04) : 1002 - 1018
  • [3] Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
    Rubén Ruiz
    Ali Allahverdi
    [J]. Annals of Operations Research, 2007, 156 : 143 - 171
  • [4] Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
    Ruiz, Ruben
    Allahverdi, Ali
    [J]. ANNALS OF OPERATIONS RESEARCH, 2007, 156 (01) : 143 - 171
  • [5] New heuristics for no-wait flowshops to minimize makespan
    Aldowaisan, T
    Allahverdi, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1219 - 1231
  • [6] Heuristics for no-wait flowshops with makespan subject to mean completion time
    Aydilek, Harun
    Allahverdi, Ali
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 219 (01) : 351 - 359
  • [7] An efficient heuristic for total flowtime minimisation in no-wait flowshops
    Framinan, Jose Manuel
    Nagano, Marcelo Seido
    Moccellin, Joao Vitor
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 46 (9-12): : 1049 - 1057
  • [8] No-wait flowshops with bicriteria of makespan and total completion time
    Allahverdi, A
    Aldowaisan, T
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (09) : 1004 - 1015
  • [9] Total flowtime in no-wait flowshops with separated setup times
    Aldowaisan, T
    Allahverdi, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (09) : 757 - 765
  • [10] An efficient heuristic for total flowtime minimisation in no-wait flowshops
    José Manuel Framinan
    Marcelo Seido Nagano
    João Vitor Moccellin
    [J]. The International Journal of Advanced Manufacturing Technology, 2010, 46 : 1049 - 1057
12345