Task scheduling neural networks

William J. Wolfe

doi:10.1117/12.167509

1 February 1994 Task scheduling neural networks

William J. Wolfe

Proceedings Volume 2058, Mobile Robots VIII; (1994) https://doi.org/10.1117/12.167509
Event: Optical Tools for Manufacturing and Advanced Automation, 1993, Boston, MA, United States

Abstract

In this paper a neural network approach to a particular class of scheduling problems is described. It uses a `k-cluster' network to enforce a non-preemptive time duration constraint and a `subset-sum' network to generate feasible schedules with a balanced load distribution. The two networks are super-imposed and the interactive nature of the parallel distributed processing inherent to Hopfield-Style neural networks negotiates the multiple constraint satisfaction requirements.

Citation Download Citation

William J. Wolfe "Task scheduling neural networks", Proc. SPIE 2058, Mobile Robots VIII, (1 February 1994); https://doi.org/10.1117/12.167509

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available