| 约束满足自适应神经网络求解车间调度问题 |
| |
| 引用本文： | 姬耀锋,张德贤. 约束满足自适应神经网络求解车间调度问题[J]. 计算机与数字工程, 2006, 34(9): 22-25 |
| |
| 作者姓名： | 姬耀锋 张德贤 |
| |
| 作者单位： | 河南工业大学机电工程学院,郑州,450052;河南工业大学机电工程学院,郑州,450052 |
| |
| 基金项目： | 河南省教育厅基础研究项目;河南省自然科学基金 |
| |
| 摘 要： | 提出一种基于约求满足的自适应神经网络方法求解车间作业调度问题。在该算法中，神经网络在运行过程中能够根据问题的约束类型、约束满足情况、启发式规则的选择来自适应调节神经元之间的连接权值，从而求得问题的可行解。仿真实验证明了算法的有效性。
|
| 关 键 词： | 约束满足自适应神经网络 车间作业调度问题 强约束 弱约束 |
| 修稿时间： | 2005-12-15 |
The Constraint Satisfaction Adaptive Neural Network for Job Shop Scheduling Problem |
| |
| Ji Yaofeng,Zhang Dexian. The Constraint Satisfaction Adaptive Neural Network for Job Shop Scheduling Problem[J]. Computer and Digital Engineering, 2006, 34(9): 22-25 |
| |
| Authors: | Ji Yaofeng Zhang Dexian |
| |
| Abstract: | This paper proposes a method of adaptive neural network based on constraint satisfaction for Job Shop Scheduling Problem.The neural network has the property of adapting its connection weights according to the constraint type of the JSSP,the satisfied situation of constraint and choice of the heuristic rules While solving feasible solution,at last it gains a feasible solution of the JSSP.The simulation experiment has indicated the algorithm validity. |
| |
| Keywords: | Constraint satisfaction adaptive neural network Job Shop Scheduling Problem strong constraint weak constraint |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
