.png){kind=icon}
返回
Extended Genetic Algorithm for solving open-shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3177-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Open-shop scheduling problem (OSSP) is a well-known topic with vast industrial applications which belongs to one of the most important issues in the field of engineering. OSSP is a kind of NP problems and has a wider solution space than other basic scheduling problems, i.e., Job-shop and flow-shop scheduling. Due to this fact, this problem has attracted many researchers over the past decades and numerous algorithms have been proposed for that. This paper investigates the effects of crossover and mutation operator selection in Genetic Algorithms (GA) for solving OSSP. The proposed algorithm, which is called EGA_OS, is evaluated and compared with other existing algorithms. Computational results show that selection of genetic operation type has a great influence on the quality of solutions, and the proposed algorithm could generate better solutions compared to other developed algorithms in terms of computational times and objective values.
Keyword:
Extended Genetic Algorithm
Makespan
Crossover
Mutation
Open-shop scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Low-temperature paraelectric–ferroelectric phase transformation in hydrothermal BaTiO3 particles
PREAI
分享收藏分享收藏
查看更多内容