.png){kind=icon}
返回
Multi-objective no-wait flowshop scheduling problems: models and algorithms
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2010.543937.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article studies multi-objective no-wait flowshop scheduling problems to minimise both makespan and total tardiness. This problem is commonly denoted by F/nwt/TT, C-max. This article mathematically formulates the problem using two effective multi-objective mixed integer linear programming models. The multi-objective mathematical models are then solved by a multiple criteria decision making approach, called Fuzzy programming method. Moreover, the article proposes a novel multi-objective iterated local search algorithm incorporating three types of local search engine: greedy, moderate and curtailed fashions. The algorithm is carefully evaluated for its performance against two available algorithms by means of multi-objective performance measures and statistical tools. The results show that the proposed solution method outperforms the others.
Keyword:
no-wait flowshop scheduling
multi-objective iterated local search algorithm
mixed integer linear programming model
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏分享收藏
查看更多内容