Scheduling for flexible flow-shop problem based on an improved genetic algorithm

This paper analyzes the characteristics of flexible flow-shop scheduling problem, using a new coding method and an improved genetic algorithm to solve the problem. This paper solves the problem by using the genetic manipulation and elitism strategy. The experimental results have shown that the proposed algorithm is available and effective approach for the FJSP.