A review and evaluation of multiobjective algorithms for the flowshop scheduling problem

被引:136
|
作者
Minella, Gerardo [1 ]
Ruiz, Ruben [1 ]
Ciavotta, Michele [2 ]
机构
[1] Univ Politecn Valencia, Grp Sistemas Optimizac Aplicada, Inst Tecnol Informat, E-46071 Valencia, Spain
[2] Univ Roma Tre, Dipartimento Informat & Automaz, Rome, Italy
关键词
scheduling; flowshop; multiobjective; review; evaluation;
D O I
10.1287/ijoc.1070.0258
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper contains a complete and updated review of the literature for multiobjective flowshop problems, which are among the most studied environments in the scheduling research area. No previous comprehensive reviews exist in the literature. Papers about lexicographical, goal programming, objective weighting, and Pareto approaches have been reviewed. Exact, heuristic, and metaheuristic methods have been surveyed. Furthermore, a complete computational evaluation is also carried out. A total of 23 different algorithms including both. owshop-specific methods as well as general multiobjective optimization approaches have been tested under three different two-criteria combinations with a comprehensive benchmark. All methods have been studied under recent state-of-the-art quality measures. Parametric and nonparametric statistical testing is profusely employed to support the observed performance of the compared methods. As a result, we have identified the best-performing methods from the literature, which along with the review, constitutes a reference work for further research.
引用
收藏
页码:451 / 471
页数:21
相关论文
共 50 条
  • [31] Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
    Fernandez-Viagas, Victor
    Framinan, Jose M.
    COMPUTERS & OPERATIONS RESEARCH, 2015, 64 : 86 - 96
  • [32] Cooperative metaheuristics for the permutation flowshop scheduling problem
    Vallada, Eva
    Ruiz, Ruben
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (02) : 365 - 376
  • [33] A green scheduling algorithm for the distributed flowshop problem
    Li, Yuan-Zhen
    Pan, Quan-Ke
    Gao, Kai-Zhou
    Tasgetiren, M. Fatih
    Zhang, Biao
    Li, Jun-Qing
    APPLIED SOFT COMPUTING, 2021, 109
  • [35] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Tariq A. Aldowaisan
    Ali Allahverdi
    The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
  • [36] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Aldowaisan, Tariq A.
    Allahverdi, Ali
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4): : 311 - 323
  • [37] Two NEH Heuristic Improvements for Flowshop Scheduling Problem with Makespan Criterion
    Sauvey, Christophe
    Sauer, Nathalie
    ALGORITHMS, 2020, 13 (05)
  • [38] A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
    Sung, CS
    Kim, YH
    Yoon, SH
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 121 (01) : 179 - 192
  • [39] A two-agent scheduling problem in a two-machine flowshop
    Ahmadi-Darani, Mohammad-Hasan
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (03) : 289 - 306
  • [40] A two-machine flowshop scheduling problem with deteriorating jobs and blocking
    Lee, Wen-Chiung
    Shiau, Yau-Ren
    Chen, Shiuan-Kang
    Wu, Chin-Chia
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 124 (01) : 188 - 197