Using constraint satisfaction adaptive neural network and efficient heuristics for job-shop scheduling (original) (raw)

AI-generated Abstract

The research integrates constraint satisfaction adaptive neural networks (CSANN) and efficient heuristics to address the complexities of job-shop scheduling problems. It aims to enhance scheduling efficiency through advanced optimization techniques, specifically focusing on the adaptation of neural networks to manage constraints effectively. The findings suggest significant improvements in solving scheduling challenges compared to traditional methods, demonstrating the potential of CSANN in real-world applications.

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact

Job shop scheduling by constraint satisfication

1993

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.