返回
A decomposition-based kernel of Mallows models algorithm for bi- and tri-objective permutation flowshop scheduling problem
DOI:10.1016/j.asoc.2018.07.011.png)
摘要
En 中文
In the last decades, the permutation flowshop scheduling problem (PFSP) has been thoroughly studied in combinatorial optimization and scheduling research. The most common objectives for this problem are makespan, total flowtime, and total tardiness. Furthermore, most production scheduling problems naturally involve multiples conflicting objectives to be optimized. Over the years, several approaches have been proposed to solve multi-objective PFSP. In the multi-objective optimization field of research, the multi-objective evolutionary algorithms based on decomposition has been recognized as one of the main strategies for solving multi-objective optimization problems. In this paper, we present a MOEA that integrates the decomposition approach and a probability model for ranking data (particularly, the Mallows model) for solving PFSP minimizing two and three objectives. We have conducted an extensive experimental study using a well-known benchmark set. In the bi-objective case, the proposed algorithm achieves competitive results compared to the best-known approximated Pareto fronts from the literature. In the tri-objective scenario, our algorithm achieves the best results in comparison to some state-of-the-art decomposition-based algorithms. (C) 2018 Published by Elsevier B.V.
Keyword:
Flowshop scheduling
Multi objective optimization
Decomposition approach
Mallows model
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization在进化多目标优化中使用平均Hausdorff距离作为性能度量

