| 基于混合遗传算法的Job-Shop调度问题的研究 |
| |
| 引用本文： | 胡岚,涂海宁,刘建胜.基于混合遗传算法的Job-Shop调度问题的研究[J].现代制造工程,2006(9):23-25. |
| |
| 作者姓名： | 胡岚 涂海宁 刘建胜 |
| |
| 作者单位： | 南昌大学机电工程学院,南昌,330029 |
| |
| 摘 要： | Job-Shop调度问题是最困难的组合优化问题之一,由于其固有的计算复杂性,一般无法利用经典解析算法求出最优解。结合实际生产情况,建立了Job-Shop调度问题的模型,并基于遗传算法与局部搜索启发式算法相结合的混合遗传算法的思想给出了求解此模型的算法过程。
|
| 关 键 词： | Job-Shop调度 遗传算法 局部搜索启发式算法 |
| 文章编号： | 1671-3133(2006)09-0023-03 |
| 修稿时间： | 2006年6月5日 |
Research on the Job-Shop scheduling based on mixed genetic algorithm |
| |
| Hu Lan,Tu Haining,Liu Jiansheng.Research on the Job-Shop scheduling based on mixed genetic algorithm[J].Modern Manufacturing Engineering,2006(9):23-25. |
| |
| Authors: | Hu Lan Tu Haining Liu Jiansheng |
| |
| Abstract: | Job-Shop Scheduling is one of the most difficult problems in the field of combinational optimization.It is usually hard to achieve the optimal solution with classical methods due to its high computational complexity.Designs the model of Job-Shop scheduling,presents the solution based on a mixed genetic algorithm combined the genetic algorithm and heuristical algorithm. |
| |
| Keywords: | Job-Shop scheduling Genetic algorithm Heuristical algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
