| 一种基于遗传算法求解车间调度问题的优化方法 |
| |
| 引用本文： | 常建娥,何燕. 一种基于遗传算法求解车间调度问题的优化方法[J]. 物流科技, 2006, 29(2): 64-65 |
| |
| 作者姓名： | 常建娥 何燕 |
| |
| 作者单位： | 武汉理工大学,湖北,武汉,430070 |
| |
| 摘 要： | 遗传算法是解决车间调度问题的有效方法之一。但在构造适应度函数时由于调度问题诸多的束条件使得直接求解十分困难。罚函数法将约束条件加到目标函数上，变有约束为无约束．能较易求解该类问题。
|
| 关 键 词： | 遗传算法 车间调度 罚函数法 |
| 文章编号： | 1002-3100（2006）02-0064-02 |
| 收稿时间： | 2005-09-21 |
| 修稿时间： | 2005-09-21 |
A Method to Solve the Job Shop Schedule Problem Based on Genetic Algorithm |
| |
| CHANG Jian-e,HE Yan. A Method to Solve the Job Shop Schedule Problem Based on Genetic Algorithm[J]. Logistics Management, 2006, 29(2): 64-65 |
| |
| Authors: | CHANG Jian-e HE Yan |
| |
| Affiliation: | Wuhan University of Technology,Wuhan 430070, China |
| |
| Abstract: | Genetic algorithm is one of efficient methods to solve Job shop schedule problem.But owing to the multi-restriction.it is very hard to get the result when constructing fitness function.But penalty function method can solve this problem easily by adding restrictions to target function,which becomes restrictions to nonrestrictions. |
| |
| Keywords: | genetic algorithm job shop schedule penalty function method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
