Job-shop scheduling based on modified tank-hopfield linear programming networks

The Tank-Hopfield linear programming network is modified to solve job-shop scheduling, a classical optimization problem. Using a linear energy function, the approach described in this paper avoids the traditional problems associated with most Hopfield networks using quadratic energy functions. Although this approach requires more hardware (in terms of processing elements and resistive interconnects) than a recent approach by Zhou et al. (IEEE Trans. Neural Networks 2, 175-179, 1991) the neurons in the modified Tank-Hopfield network do not perform extensive calculations, unlike those described by Zhou et al.