Abstract
According to the characteristics of flexible job shop scheduling (FJPS), a mathematical model was established to minimize the maximum completion time, and an improved genetic algorithm was proposed to solve the problem. A variety of heuristic methods are used to improve the quality of the initial solution. The parallel double-chain encoding is designed and the optimal insertion method is proposed to improve the quality of the solution. Two crossover methods, namely IPOX crossover and multi-point crossover, are adopted to inherit the excellent genes from the parent generation and balance the global development ability of the algorithm. In different coding layers, a variety of variation methods were used to maintain the diversity of the population. The local development ability of the algorithm is enhanced by variable neighborhood search. Finally, by solving the Brandimarte standard example and comparing with other algorithms, the feasibility and effectiveness of the proposed algorithm are verified.
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.
