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月
外部発表はい

ASJC Scopus subject areas

  • 制御およびシステム工学
  • 人工知能
  • 電子工学および電気工学

フィンガープリント

「Job-shop scheduling based on modified tank-hopfield linear programming networks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル