Branch genetic algorithm applied to the flexible job shop scheduling problem

According to the characteristic of flexible job shop scheduling problem, branch genetic algorithm is presented. In view of the branch code method, branch genetic operators are constructed to satisfy the restraint condition of the feasible scheduling. This algorithm not only can avoid the flaw of simple genetic algorithm, but also may indicate the descendants to develop new quality owning to acclimation. The computation results validate the effectiveness of the proposed algorithm.