首页 | 本学科首页   官方微博 | 高级检索  
     

基于约束满足神经网络的作业车间调度算法研究
引用本文:吴芬芬,常军林.基于约束满足神经网络的作业车间调度算法研究[J].郑州轻工业学院学报(自然科学版),2007,22(4):61-63,74.
作者姓名:吴芬芬  常军林
作者单位:河南交通职业技术学院,计算机科学系,河南,郑州,450005
摘    要:将约束满足神经网络(CSNN)模型和启发式算法相结合,应用到作业车间调度(JSP)问题上.实验数据表明:CSNN具有结构简单、建模方便的优点,启发式算法的引入大大地改善了CSNN求解作业车间调度问题的性能和有效性,是解决JSP问题的一种有效手段.

关 键 词:约束满足神经网络  启发式算法  作业车间调度
文章编号:1004-1478(2007)04-0061-03
收稿时间:2007-01-15
修稿时间:2007-01-15

Job-shop scheduling based on constraint satisfaction neural networks
WU Fen-fen,CHANG Jun-lin.Job-shop scheduling based on constraint satisfaction neural networks[J].Journal of Zhengzhou Institute of Light Industry(Natural Science),2007,22(4):61-63,74.
Authors:WU Fen-fen  CHANG Jun-lin
Affiliation:Dept. of Comp. Sci. , Henan Communications Polytechnic College, Zhengzhou 450005, China
Abstract:The combination of constraint satisfaction neural networks and heuristic algorithm were applied to job-shop scheduling.The result shows: CSNN can be constructed and modeled very easily,the introduction of heuristic algorithm largely improves the performance and efficiency of job-shop scheduling and is an effective means of JSP.
Keywords:CSNN  heuristic algorithm  JSP
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号