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

混沌神经网络优化算法用于求解无等待流水调度问题的最小最大完工时间
引用本文:王新军,何率天.混沌神经网络优化算法用于求解无等待流水调度问题的最小最大完工时间[J].数学的实践与认识,2010,40(7).
作者姓名:王新军  何率天
作者单位:1. 空军第一航空学院航空修理工程系,河南信阳,464000
2. 空军第一航空学院基础部,河南信阳,464000
基金项目:国家自然科学基金(60672092)
摘    要:利用李小平等提出的相邻工件加工结束时间差矩阵,将求解无等待流水调度问题的最小最大完工时间(Makespan)问题映射为TSP问题,构造对应的能量函数,进而得到随机混沌神经网络(SCSA)算法.实验结果证明该混沌神经网络优化算法优于RAJ算法和GANRAJ算法.

关 键 词:无等待流水调度  最大完工时间  神经网络

A Chaotic Neural Network Algorithm for Minimizing Makespan in No-wait Flow Shop Scheduling
WANG Xin-jun,HE Shuai-tian.A Chaotic Neural Network Algorithm for Minimizing Makespan in No-wait Flow Shop Scheduling[J].Mathematics in Practice and Theory,2010,40(7).
Authors:WANG Xin-jun  HE Shuai-tian
Institution:WANG Xin-jun~1,HE Shuai-tian~2 (1.Aeronautical Repair Engineering Department,First Aeronautical College of the Air Force,Xinyang 464000,China) (2.Department of Foundation,China)
Abstract:In this paper,a new chaotic neural network:Stochastic Chaotic Simulated Annealing (SCSA) algorithm is introduced for no-wait flow shops with makespan minimization. In order to use the SCSA algorithm,a matrix denoting minimum finish times of adjacent jobs proposed by Li was created and the scheduling problem can then be transferred into a TSP problem,and then the corresponding energy function was proposed,then a SCSA algorithm was given.The simulation results show that the proposal outperforms RAJ and GANRAJ...
Keywords:no-wait flow shop scheduling  makespan  neural network    
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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