By Topic

A parallel distributed processing technique 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

2 Author(s)
Chun-Chi Lo ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Ching-Chi Hsu

This paper presents a new parallel distributed processing (PDP) approach to solve job-shop scheduling problem which is NP-complete. In this approach, a stochastic model and a controlled external energy is used to improve the scheduling solution iteratively. Different to the processing element (PE) of the Hopfield neural network model, each PE of our model represents an operation of a certain job. So, the functions of each PE are a little more complicated than that of a Hopfield PE. Under such model, each PE is designed to perform some stochastic, collective computations. From the experimental result, the solutions can be improved toward optimal ones much faster than other methods. Instead of the polynomial number of variables needed in neural network approach, the variables number needed to formulate a job-shop problem in our model is only a linear function of the operation number contained in the given job-shop problem.

Published in:

Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on  (Volume:2 )

Date of Conference:

25-29 Oct. 1993