Abstract
To solve the problem of large number of redundant search existing in traditional genetic algorithm for solving Flexible Job Shop Scheduling Problem (FJSP), a two-layer genetic algorithm based on matrix coding for FJSP was proposed. The algorithm used double matrix structure to encode which included machine selection matrix and operation sorting matrix. Outer genetic algorithm is used to search for the best option of machine selection, which transform FJSP to JSP. Inner genetic algorithm is used to solve the sub-problem of JSP based on machine selection matrix. The effectiveness of proposed algorithm was verified by analyzing the results of benchmarks.
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.
