A high performing metaheuristic for multi-objective flowshop scheduling problem

摘要

Genetic algorithm is a powerful procedure for finding an optimal or near optimal solution for the flowshop scheduling problem. This is a simple and efficient algorithm which is used for both single and multi-objective problems. It can easily be utilized for real life applications. The proposed algorithm makes use of the principle of Pareto solutions. It mines the Pareto archive to extract the most repetitive sequences, and constitutes artificial chromosome for generation of the next population. In order to guide the search direction, this approach coupled with variable neighborhood search. This algorithm is applied on the flowshop scheduling problem for minimizing makespan and total weighted tardiness. For the assessment of the algorithm, its performance is compared with the MOGLS. The results of the experiments allow us to claim that the proposed algorithm has a considerable performance in this problem.