Polychromatic-sets-based improved genetic algorithm for solving multi-species FJSP

To avoid premature or convergence of conventional genetic algorithm, an improved genetic algorithm based on polychromatic sets theory was presented. In the process of encoding, decoding and mutation, by searching the contour matrix, the algorithm speed was improved therefore the solution efficiency was improved. Then, single encoding was used to represent the double-constrained scheduling problems to reduce time and space complexity of the improved genetic algorithm. Comparison of examples verified that the improved genetic algorithm was feasible and effective, which could be used to deal with Flexible Job-Shop Scheduling Problem (FJSP).