计算机工程与应用2019，Vol.55Issue(23)：15-21,34,8.DOI:10.3778/j.issn.1002-8331.1908-0410
遗传算法解柔性作业车间调度问题应用综述
Review of Application of Genetic Algorithms for Solving Flexible Job Shop Scheduling Problems
摘要
Abstract
The flexible job shop scheduling problem is a typical NP-hard problem, which can guide the actual production of factories. In recent years, with the development of genetic algorithms, the ideas and methods of using genetic algorithms to solve flexible job shop scheduling problems are emerging in an endless stream. In order to promote the further develop-ment of genetic algorithm for flexible job shop scheduling problem, this paper first introduces the research theory of flexible job shop scheduling problem, and then classifies existing improved methods that are based on genetic algorithms. In the end, by analyzing the existing problems, several future research directions are proposed.关键词
柔性作业车间调度问题/遗传算法/目标函数/算法改进Key words
flexible job shop scheduling problem/genetic algorithm/objective function/algorithm improvement分类
信息技术与安全科学引用本文复制引用
罗雄,钱谦,伏云发..遗传算法解柔性作业车间调度问题应用综述[J].计算机工程与应用,2019,55(23):15-21,34,8.基金项目
国家自然科学基金(No.61463024). （No.61463024）
