解Job-shop调度问题的神经网络方法
Neural Network Method of Solving Job-shop Scheduling Problem
-
摘要: 研究用神经网络方法解决Job-shop调度问题.首先描述解Job-shop调度问题的算法, 然后给出这一算法及其网络性质的理论结果.仿真实验结果证明了该方法是可行的.最后, 针对几类典型调度问题的解决进一步说明了这一方法的优势.Abstract: The improved methods for Job-shop scheduling problem (JSP) with neural network are described. And the theorem of the convergence of the networks, the theorem of the efficiency of the solutions and the theorem of the attractors of the networks are given. Then computer simulation result shows that our methods are good. In the end, three kinds of scheduling problems--JSP with priority, JSP with due dates and JSP with automated moving vehicle--are solved by our methods. The corresponding simulations are successfully done.
-
Key words:
- Neural network /
- combinatorial optimization /
- scheduling problem
-
计量
- 文章访问数: 2669
- HTML全文浏览量: 144
- PDF下载量: 1385
- 被引次数: 0
下载:
