an:06229656
Zbl 1289.90089
Xu, Jianyou; Gu, Shusheng
A new neighborhood based Memetic algorithm for permutation flowshop scheduling problem
ZH
Control Decis. 27, No. 12, 1781-1786 (2012).
00326402
2012
j
90B35 68T20
permutation flowshop scheduling; NEH neighbourhood; Memetic algorithm
Summary: The permutation flowshop scheduling problem (PFSP) is a kind of classical production scheduling problem, which is NP-hard. The traditional optimization method cannot be adopted to solve large scale problems. Therefore, this paper proposes a Memetic algorithm for the PFSP, in which a new neighborhood structure based on NEH is developed. In addition, the size of the neighborhood is dynamically adjusted during the search process. The computational results on Benchmark problems show that the proposed Memetic algorithm is effective and superior to a particle swarm optimization in the literature.