Abstract:

An improved GA scheduling algorithm (IHSGA) base on HS is  firstly proposed to solve the blocking flow shop scheduling problems(BFSP) with the objective of minimizing the makespan of the jobs in the literature. The BFSP scheduling principle figure is constructed and the process of operation method is described. The application steps and the key problems of hybrid algorithm are discussed in detail and NEH & local search methods are used to improve the hybrid. Simulation results show that IHSGA algorithms can obtain a better solution than other algorithms.

Key words: blocking flow shop;harmony search;genetic algorithm;local search;NEH heuristic