期刊文献+

单机可控排序问题的神经网络模型

The Model of the Single-machine Controllable Scheduling on Neural Network
下载PDF
导出
摘要 本文建立了1|rj|cmax的可控排序问题的数学规划模型,利用投影算子与变分不等式的关系,构造了求解数学规划模型的神经网络动力系统,运用Lyapunov方法,证明了该系统全局稳定,且系统的平衡点就是所求问题的最优解。 The mathematics programming model of the Single-machine Controllable Scheduling on the 1|rj|Cmax is put forward. By the relation of project operator and variational inequality, the neural network dynamics system is proposed and the global stability of the equilibrium point is proved. Moreover, the equilibrium point is also proved to be the optimum solution of the mathematics programming problem.
作者 许先云
机构地区 江南大学理学院
出处 《安庆师范学院学报(自然科学版)》 2006年第1期52-54,共3页 Journal of Anqing Teachers College(Natural Science Edition)
关键词 可控排序 数学规划 神经网络 controllable scheduling, mathematics programming, neural network
  • 相关文献

参考文献4

  • 1唐国春,等.现代排序理论[M].上海:上海科学普及出版社,2003.
  • 2Y.Xia,H.Leungand J.Wang.A projection neural network and its application to constrained optimization problems [J].IEEETrans.Circuits and System.2002,49:447-457.
  • 3P.B.Luh,X.Zhao,Y.Wang and L.S.Thakur Lagrangian relaxation neural networks for job shop scheduling[J].IEEE Transactions on Robotics and Automation,2000,16:78-88.
  • 4M.Fukushima.Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems[J].mathematical programming,1992,53:99-110.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部