Title: Permutation flow-shop scheduling using a hybrid differential evolution algorithm

Authors: Hai-yan Wang; Ye-bo Lu; Wen-li Peng

Addresses: Mechanical and Electrical Engineering College, Jiaxing University, Jiahang Road No.118, Jiaxing 314000, China ' Mechanical and Electrical Engineering College, Jiaxing University, Jiahang Road No.118, Jiaxing 314000, China ' Mechanical and Electrical Engineering College, Jiaxing University, Jiahang Road No.118, Jiaxing 314000, China

Abstract: In this paper, a hybrid differential evolution algorithm is developed for the permutation flow-shop scheduling problem to minimise the makespan. The iterative evolution procedure of the algorithm includes a DE-based global search for the population and an insert-based local search for the best individual. Experiments are performed, with the goal to discuss the impacts of different parameter values and the local search on the performance of the algorithm. The results reveal that choosing an appropriate CR is crucial on the global search performance for medium or larger-sized problems, and local search procedure brings the improvement in the optimisation ability, but leads to inevitable increase of computational time. Our future work is to exploit a more effective local search, which is capable of ensuring great optimisation power with reasonable computation time.

Keywords: permutation flow shop scheduling; hybrid differential evolution; local search; makespan; optimisation.

DOI: 10.1504/IJCSM.2013.057254

International Journal of Computing Science and Mathematics, 2013 Vol.4 No.3, pp.298 - 307

Received: 13 May 2013
Accepted: 20 Jun 2013
Published online: 10 May 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article