Abstract
In this study, an improved hybrid genetic algorithm is firstly proposed to solve the flexible job shop scheduling problem. Three operators, namely tournament plus selection, partly cyclic crossover and inversion exchange mutation are used to improve the traditional genetic algorithm. The effectiveness of the operators is verified by experiments, and the performance of the algorithm is shown to be improved. Furthermore, tabu search is used to hybrid with the improved genetic algorithm. It is also experimentally proved that the hybrid algorithm has better performance in solving the flexible job shop scheduling.KeywordsFlexible job shopTabu searchHybrid genetic algorithmStatic scheduling
Sign-in/Register to access full text options 
Free) 
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
