| 混合Flow Shop调度问题的遗传算法求解 |
| |
| 引用本文： | 王结南.混合Flow Shop调度问题的遗传算法求解[J].鄂州大学学报,2005,12(3):28-30. |
| |
| 作者姓名： | 王结南 |
| |
| 作者单位： | 鄂州大学,电子工程系,湖北,鄂州,436000 |
| |
| 摘 要： | 该文构造了一种新的遗传启发搜索算法，用于求解混Flow—Shop调度问题，通过分析和实例计算表明，该算法能够有效地适用于大规模加工过程中调度问题的优化计算，在运行时间、适应性和最优率等方面都具有很好的搜索优势。
|
| 关 键 词： | 混合Flow Shop调度问题 最优加工时间 遗传算法 |
| 文章编号： | 1008-9004(2005)03-0028-03 |
The Genetic Algorithm Which Mixes Flow Shop Dispatcher's Question is Asked and Solved |
| |
| WANG Jie-nan.The Genetic Algorithm Which Mixes Flow Shop Dispatcher''''s Question is Asked and Solved[J].Journal of Ezhou University,2005,12(3):28-30. |
| |
| Authors: | WANG Jie-nan |
| |
| Abstract: | This paper constructs a new kind of genetic inspiration algorithm used for solving the mixing Flow-shop dispatcher's question. By analyzing and exampling, it is showed that this algorithm can be effectively used in the optimization calculation of the dispatcher question of large scale processing, and it enjoys the advantages in running time, adaptability and the optimization proportion. |
| |
| Keywords: | the mixing Flow-shop dispatcher's question the optimization processing time the genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
