Abstract
The authors present a novel analog computational network for solving NP-complete constraint-satisfaction problems, i.e., job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost functions, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. It is shown how to map a job-shop scheduling problem onto a simple neural net, where the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the proposed approach produces better solutions than the traveling-salesman-problem-type Hopfield approach and the integer linear programming approach of Y. P. Foo and Y. Takefuji (1988) in terms of the quality of the solution and the network complexity.
| Original language | English (US) |
|---|---|
| Title of host publication | IJCNN. International Joint Conference on Neural Networks |
| Publisher | Publ by IEEE |
| Pages | 889-894 |
| Number of pages | 6 |
| State | Published - Dec 1 1990 |
| Event | 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) - San Diego, CA, USA Duration: Jun 17 1990 → Jun 21 1990 |
Other
| Other | 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) |
|---|---|
| City | San Diego, CA, USA |
| Period | 6/17/90 → 6/21/90 |