| Flow－shop调度问题的遗传启发算法 |
| |
| 引用本文： | 黄宇纯,王树青,王骥程.Flow－shop调度问题的遗传启发算法[J].信息与控制,1996(4). |
| |
| 作者姓名： | 黄宇纯 王树青 王骥程 |
| |
| 作者单位： | 浙江大学工业控制技术国家重点实验室 |
| |
| 摘 要： | 结合遗传算法和启发式规则，构造了一种新的遗传启发搜索算法，用于求解Ｆｌｏｗ－ｓｈｏｐ调度问题．通过分析和实例计算表明，算法能够有效地适用于大规模加工过程中调度问题的优化计算，在运行时间，适应性和最优率等方面都具有很好的搜索优势．
|
| 关 键 词： | Flow－shop调度问题，最优加工时间，遗传算法，启发式规则 |
FLOW SHOP SCHEDULING PROBLEM BY GENETIC HEURISTIC ALGORITHM |
| |
| HUANG Yuchun,WANG Shuqing,WANG Jicheng.FLOW SHOP SCHEDULING PROBLEM BY GENETIC HEURISTIC ALGORITHM[J].Information and Control,1996(4). |
| |
| Authors: | HUANG Yuchun WANG Shuqing WANG Jicheng |
| |
| Abstract: | A new Genetic Heuristic Algorithm(GHA), combining genetic algorithm with heuristic rules, is presented for solving flow shop scheduling problem in this paper. On the basis of analysing and calculating of examples, it is proved that the new algorithm is efficient to use for optimization of large scale products, and it has very capable for searching on calculation time, fitness, and goodness. |
| |
| Keywords: | flow shop scheduling problem makespan genetic algorithm heuristic rules |
| 本文献已被 CNKI 等数据库收录！ |
