Abstract
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable neighborhood search is adopted to improve the quality of individuals of GA before injecting them into the population and strengthen the local search ability. Two different neighborhood structures are used in the VNS. Representative flexible job shop scheduling benchmark problems are solved using the VNGA. Computational results show that the proposed algorithm is efficient and effective.KeywordsGenetic AlgorithmVariable Neighborhood SearchFlexible job shop scheduling
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.
