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.

Date Published: 1 February 1994
PDF: 7 pages
Proc. SPIE 2058, Mobile Robots VIII, (1 February 1994); doi: 10.1117/12.167509

Published in SPIE Proceedings Vol. 2058:
Mobile Robots VIII
William J. Wolfe; Wendell H. Chun, Editor(s)