By Topic

Scheduling with neural networks for flexible manufacturing systems

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)
Z. -P. Lo ; Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA ; B. Bavarian

An application of neural networks in multiple-task scheduling problems is presented. The optimum task scheduling for manufacturing processes is, in general, an NP-complete problem for single server or manufacturing cell. The problem is more severe for scheduling many tasks with precedence constraints among them, timing requirements, set-up costs and completion deadlines to several manufacturing cells. The crossbar Hopfield network which is used to solve the classical traveling salesman problem is extended to a three-dimensional neuro-box network to solve multiple task scheduling on multiple servers. The complete formulation of the problem is presented. This includes the definition of the energy function for the neural network and the differential equations for the neurons. Several simulations are carried out and presented

Published in:

Robotics and Automation, 1991. Proceedings., 1991 IEEE International Conference on

Date of Conference:

9-11 Apr 1991