Abstract
In this contribution the application of a genetic algorithm to a real-world scheduling problem with highly coupled production is presented. Since the schedules are highly constrained, special attention is paid to the handling of constraints at the different levels of the implementation of the algorithm. The quality of the result and its numerical performance is discussed in comparison with a mathematical programming algorithm.
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.
