Abstract

The flexible job shop scheduling problem is an extension of the classic job shop scheduling problem, which allows the process to be processed on any of a number of machines. Aiming at the characteristics of flexible job shop scheduling, which only needs to allocate processing machines and sort the operations, a scheduling algorithm based on genetic algorithm and variable neighborhood search algorithm for solving FJSP is proposed. The hybrid algorithm can have strong global search ability and local search ability at the same time, and improve the speed of the hybrid algorithm to solve the flexible job shop scheduling problem and the quality of the scheduling solution. Finally, the proposed algorithm is used to solve the validity of the benchmark test problem verification algorithm.

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.