Using Matrix-Coded Genetic Algorithm for Solving the Flexible Job-Shop Scheduling

A matrix-coded genetic algorithm is proposed for solving the flexible job shop scheduling problem (FJSP). Novel strategies have been incorporated into crossover operator and mutation operator to assist the matrix-coded genetic algorithm to perform well. The matrix-coded genetic algorithm is a direct-viewing and easy to operate, a set of benchmark taken from the literature are tested. The computation results show the matrix-coded genetic algorithm is effective.