By Topic

A neural network architecture for faster dynamic scheduling in 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)
C. Dagli ; Dept. of Eng. Manage., Missouri Univ., Rolla, MO, USA ; R. Huggahalli

Computation of optimum schedules for dynamic scheduling of tasks introduces an overhead delay in the processing time of the programs executed in an automated system. This is particularly so if serial scheduling algorithms are used. It is proposed that tasks be dynamically scheduled with the Lawler scheduling algorithm and that, to minimise the additional delay due to the computation of optimum schedules, a neural network be used for retrieving optimal solutions. A neural network architecture that can recognise binary vector representations of scheduling problems and retrieve optimal schedules in negligible time is described

Published in:

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

Date of Conference:

9-11 Apr 1991