By Topic

An adaptive feedback neural network approach to job-shop scheduling problem

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
$33 $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

2 Author(s)
Wenle Zhang ; Dept. of Engineering Technology, University of Arkansas, Little Rock, 72204, USA ; Rutao Luo

Job-shop scheduling problem is a typical representative of NP-complete problems and it is also a popular topic for the researchers during the recent decades. Lots of artificial intelligence techniques were used to solve this kind of problems, such as: genetic algorithm, tabu searching method, simulated annealing and neural network. Based on the previous research of Zhou and Willems, this paper proposes a neuro-dynamic model with two heuristics to solve job-shop scheduling problems. The stability of this neural network is proven by using Lyapunov stability theorem. Both small-size and big-size problems are used to test this neural network. Simulation results of some tested samples are given. And the performance of this neural network is compared with several other neural works under experimental conditions.

Published in:

2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence)

Date of Conference:

1-8 June 2008