Skip to Main Content
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. An improved genetic algorithm combined with local search is proposed to solve the FJSP with makespan criterion. To control the local search and convergence to the global optimal solution, time-varying crossover probability and time varying maximum step size of tabu search are introduced. Representative flexible job shop scheduling benchmark problems are solved in order to test the effectiveness and efficiency of the proposed algorithm. Computational results show that the proposed genetic algorithm is efficient and effective.
Computational Intelligence and Design, 2008. ISCID '08. International Symposium on (Volume:1 )
Date of Conference: 17-18 Oct. 2008