.png){kind=icon}
返回
Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-017-2465-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Recently, the flow shop scheduling problem under blocking has gained broad attention in academic fields. Various papers have been devoted to investigate this issue and have been mostly restricted to the treatment of single objective at a time. Nevertheless, in practice the scheduling decisions often involve simultaneous consideration of multiple objectives (usually contradicting) to give more realistic solutions to the decision maker. In this study, we deal with a bi-objective blocking permutation flow shop scheduling problem where the makespan and total completion time are considered as objective functions. Both measures lead to an NP-hard problem. Our interest is to propose for the first time a Genetic Algorithm based on NSGA-II for searching locally Pareto-optimal frontier for the problem under consideration. The individuals in the algorithm are represented as discrete job permutations. Some specific versions of the NEH heuristic are used to generate the initial population. Non-dominated solutions and differences among parents are taken advantage of when designing the selection operator. The efficiency of the proposed algorithm, based on various metrics, is compared against the multiobjective evolutionary algorithm SPEA-II.
Keyword:
Multiobjective
Flow shop
Blocking
Pareto-optimal solutions
NSGA-II
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
A Revisit to Supercapacitor Capacitance Measurement Method 1A of IEC 62391-1IEC 62391超级电容器电容测量方法1A的再审视
PREAI
分享收藏Some heuristic algorithms for total tardiness minimization in a flowshop with blocking带有阻塞的流水车间中总迟到最小化的一些启发式算法
PREAI
分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏
查看更多内容