Article ID: | iaor2002693 |
Country: | United Kingdom |
Volume: | 28 |
Issue: | 10 |
Start Page Number: | 955 |
End Page Number: | 971 |
Publication Date: | Sep 2001 |
Journal: | Computers and Operations Research |
Authors: | Wang Dingwei, Yang Shengxiang |
Keywords: | heuristics, neural networks |
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving the feasible solution. Two heuristics are presented, which can be combined with the neural network. One heuristic is used to accelerate the solving process of the neural network and guarantee its convergence, the other heuristic is used to obtain non-delay schedules from the feasible solutions gained by the neural network. Computer simulations have shown that the proposed hybrid approach is of high speed and efficiency. The strategy for solving practical job-shop scheduling problems is provided.