Abstract
A neural network structure has been developed which is capable of solving deterministic job-shop scheduling problems, part of the large class of np-complete problems. The problem was translated in an integer linear programming format which facilatated translation in an adequate neural network structure. Use of the presented structure eliminated the need for integer adjustments. Elementary precalculation is performed with the objective to reduce the search space allowing more rapid calculation of feasible solutions. In this precalculation the earliest possible starting times of the operations are calculated and set as tresholds in the network. The neural network structure was reliable in simulated operation and its performance was superior to structures which have been presented previously. The network structure always produces feasible solutions, in less time, without the application of integer adjustments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
