๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Least-hop path planning using neural networks

โœ Scribed by Haruko Kawahigashi; Ken-ichi Tanaka; Kazuyoshi Oshima


Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
653 KB
Volume
80
Category
Article
ISSN
8756-6621

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Dispatching rule selection using artific
โœ Huajie Liu; Jian (John) Dong ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer US ๐ŸŒ English โš– 978 KB

To schedule a job shop, the first task is to select an appropriate scheduling algorithm or rule. Because of the complexity of scheduling problems, no general algorithm sufficient for solving all scheduling problems has yet been developed. Most job-shop scheduling systems offer alternative algorithms