.png){kind=icon}
返回
An MO-GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1111/itor.12662.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the multiobjective hybrid flow shop (MOHFS) scheduling problem. In the MOHFS problem considered here, we have a set of jobs that must be performed in a set of stages. At each stage, we have a set of unrelated parallel machines. Some jobs may skip stages. The evaluation criteria are the minimizations of makespan, the weighted sum of the tardiness, and the weighted sum of the earliness. For solving it, an algorithm based on the multiobjective general variable neighborhood search (MO-GVNS) metaheuristic, named adapted MO-GVNS, is proposed. This work also presents and compares the results obtained by the adapted MO-GVNS with those of four other algorithms: multiobjective reduced variable neighborhood search, nondominated sorting genetic algorithm II (NSGA-II), and NSGA-III, and another MO-GVNS from the literature. The results were evaluated based on the Hypervolume, Epsilon, and Spacing metrics, and statistically validated by the Levene test and confidence interval charts. The results showed the efficiency of the proposed algorithm for solving the MOHFS problem.
Keyword:
multiobjective hybrid flow shop
MO-GVNS
HFS
multiobjective optimization
VNS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
暂无机构信息
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏分享收藏Metaheuristics for solving the biobjective single-path multicommodity communication flow problem解决双目标单路径多商品通信流问题的元启发式方法
PREAI
分享收藏
查看更多内容