A new adaptive neural network and heuristics hybrid approach for job-shop s
cheduling is presented. The neural network has the property of adapting its
connection weights and biases of neural units while solving the feasible s
olution. Two heuristics are presented, which can be combined with the neura
l network. One heuristic is used to accelerate the solving process of the n
eural network and guarantee its convergence, the other heuristic is used to
obtain non-delay schedules from the feasible solutions gained by the neura
l network. Computer simulations have shown that the proposed hybrid approac
h is of high speed and efficiency. The strategy for solving practical job-s
hop scheduling problems is provided. (C) 2001 Elsevier Science Ltd. All rig
hts reserved.