By Topic

Hopfield neural networks approach for job shop scheduling problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Wan-liang ; Coll. of Inf. Eng., Zhejiang Univ. of Technol., Hangzhou, China ; Xu Xin-Li ; Wu Qi-Di

A new method based on Hopfield neural networks for solving job-shop scheduling problems (JSP) is proposed. All constraints of job-shop scheduling problems and its permutation matrix express are developed. A new calculation energy function included all constraints of job-shop scheduling problems is given. A corresponding new Hopfield neural network construction and its weights of job-shop scheduling problems are given. To avoid Hopfield neural network to converge to local minimum volume, and to produce some non-feasible scheduling solutions for JSP, simulated annealing algorithm is applied to Hopfield neural network. Hopfield neural network converging to minimum volume 0, can keep the steady outputs of neural networks as feasible solution for job-shop scheduling problem. This paper improved existing method based on Hopfield neural network for solving job-shop scheduling problems. Compared with the method, modified method can keep the steady outputs of neural networks as feasible solutions for job-shop scheduling problems.

Published in:

Intelligent Control. 2003 IEEE International Symposium on

Date of Conference:

8-8 Oct. 2003