Neural nets for job-shop scheduling, will they do the job?

A neural net structure has been developed which is capable of solving deterministic jobshop scheduling problems, part of the large class of np-complete problems. The problem was translated in an integer linear-programming format which facilitated translation in an adequate neural net structure. Use of the presented structure eliminated the need for integer adjustments. The search space was reduced by the use of precalculation, allowing the rapid calculation of feasible solutions. The neural net structure was reliable in simulated operation and its performance was superior to structures which have been presented previously