车间调度问题的并行遗传算法研究综述
A Survey on Parallel Genetic Algorithms for Shop Scheduling Problems
摘要:
已有大量的工作处理遗传算法(GAs)寻求车间调度问题的最优解。由于NP硬度,时间成本总是很重。近几十年来,随着高性能计算技术的发展,并行遗传算法在车间调度问题中的应用越来越受到人们的关注。在本文中,我们提出了国家的艺术与最近的工作解决车间调度问题,使用并行遗传算法。通过对并行遗传算法的分类,展示了该领域最具代表性的出版物,并分析了它们基于框架的设计。
英文摘要:
There have been extensive works dealing with genetic algorithms (GAs) for seeking optimal solutions of shop scheduling problems. Due to the NP hardness, the time cost is always heavy. With the development of high performance computing (HPC) in last decades, the interest has been focused on parallel GAs for shop scheduling problems. In this paper, we present the state of the art with respect to the recent works on solving shop scheduling problems using parallel GAs. It showcases the most representative publications in this field by the categorization of parallel GAs and analyzes their designs based on the frameworks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。