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

Simon Y. Foo, Yoshiyasu Takefuji, Harold Szu

研究成果: Article

17 引用 (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.

元の言語English
ページ(範囲)321-327
ページ数7
ジャーナルEngineering Applications of Artificial Intelligence
7
発行部数3
DOI
出版物ステータスPublished - 1994 6
外部発表Yes

ASJC Scopus subject areas

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

フィンガープリント Job-shop scheduling based on modified tank-hopfield linear programming networks' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用