Abstract
We describe a hybrid genetic algorithm (GA) approach to the no-wait flowshop scheduling problem using the minimize makespan as objective function. The GA approach described produces comparable or better results on benchmark flowshop problems than known heuristic methods. The representation used is a variant of one used on GA treatments of the travelling salesman problem (TSP). The genetic operators include edge recombination and three additional operators designed on analogy to known heuristic methods. Experiments show that these new operators are very effective in enhancing the performance of the traditional GA. The present approach also promises to effectively address the general job-shop problem.
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.
