Neural Network Method of Solving Job-shop Scheduling Problem
解Job-shop调度问题的神经网络方法

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.