STUDY OF THREE-MACHINE FLOW-SHOP SCHEDULING PROBLEM

A genetic branch and bound algorithm is proposed to solve the 3 machine flow-shop permutation problem, which is similar to often used the genetic local algorithm and the genetic dynamic programming algorithm. Based on the test examples that are produced with random methods and the performance Comparison with the famous Taillard'tuba search algorithm and Reeves'genetic algorithm, the experimental results show the effectiveness of the genetic branch and bound algorithm.