Abstract

For the unrelated parallel machine scheduling problem, a scheduling model with the minimum completion time as the optimization goal is established. By combining genetic algorithm and neighborhood search, a genetic-neighbor search alternate hybrid algorithm is designed. The influence of genetic algorithm population number and evolutionary algebra on the optimal solution is discussed when solving the unrelated parallel machine scheduling problem. Finally, the proposed hybrid algorithm is used to solve parallel machine scheduling problems of different scales, and compared with a single genetic algorithm to verify the effectiveness and feasibility of the proposed algorithm.

Full Text
Paper version not known

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 call

Disclaimer: 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.