Improved genetic algorithm for flexible job-shop scheduling problem

Aim In order to avoid premature convergence of conventional genetic algorithm,an improved genetic algorithm is proposed based on Polychromatic Sets.Methods To ensure the quality of the initial solution,polychromatic sets theory is used to create a flexible scheduling constraints model,and BF heuristics is combined to control the direction of variation in order to prevent the illegal operators to improve the generation of solutions.Results An example is presented to verify the feasibility and superiority of the improved genetic algorithm which is used to solve flexible scheduling.Conclusion This method can eflectively improve the efficiency of flexible scheduling.