A CONNECTIONIST METHOD TO SOLVE JOB SHOP PROBLEMS
From MaRDI portal
A new framework to solve job shop problems is proposed, based on connectionist ideas of distributed information processing. The algorithm is simple, easy to implement, fast and scalable and can be usefull to find near-optimal solutions within several seconds on a 233 Mhz i686 PC. Like other local search techniques, the operativeness of the algorithm is primarily proved empirically.
Recommendations
Cited in
(2)
This page was built for publication: A CONNECTIONIST METHOD TO SOLVE JOB SHOP PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786868)