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

Simon Y. Foo, Yoshiyasu Takefuji, Harold Szu

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)321-327
Number of pages7
JournalEngineering Applications of Artificial Intelligence
Issue number3
Publication statusPublished - 1994 Jun
Externally publishedYes


  • Hopfield neural networks
  • Job-shop scheduling
  • mixed integer-linear programming

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Artificial Intelligence
  • Electrical and Electronic Engineering


Dive into the research topics of 'Job-shop scheduling based on modified tank-hopfield linear programming networks'. Together they form a unique fingerprint.

Cite this