 |
    |
A Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem with Total Flow Time Criterion
Valentino Santucci, Marco Baioletti, and Alfredo Milani
Department of Mathematics and Computer Science, University of Perugia, Italyvalentino.santucci@dmi.unipg.it
baioletti@dmi.unipg.it
milani@dmi.unipg.it
Abstract. In this paper a new discrete Differential Evolution algorithm for the Permutation Flowshop Scheduling Problem with the total flowtime criterion is proposed. The core of the algorithm is the distance-based differential mutation operator defined by means of a new randomized bubble sort algorithm. This mutation scheme allows the Differential Evolution to directly navigate the permutations search space. Experiments were held on a well known benchmark suite and the results show that our proposal outperforms state-of-the-art algorithms on the majority of the problems.
Keywords: Differential Evolution, Permutation Flowshop Scheduling Problem, Randomized Bubble Sort
LNCS 8672, p. 161 ff.
lncs@springer.com
© Springer International Publishing Switzerland 2014