关键词: 种群, 迭代贪婪算法, 阻塞流水车间调度, 最小化最大完工时间

Abstract: Aiming at the blocking flow shop scheduling problem with minimized makespan,an effective population-based multi-layer iterated greedy algorithm was proposed.The permutation based encoding schemes was designed in the algorithm,and Nawaz-Enscore-Ham & Profile Fitting (NEH_PF) algorithm was proposed to construct the initial population for improving the quality of initial results.To enhance the local search abilities of individuals,a multi-layer iterated greedy algorithm was designed,together with the interchange and insert strategies to mutate individuals and path-relinking strategies to cross the individuals.The partly crossing policy was put forward to update the populations.The effectiveness of proposed algorithm was validated through a group of benchmark instances.

Key words: population, iterated greedy algorithm, blocking flow shop scheduling, minimized makespan