A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

摘要

In this paper, we tackle the problem of total flowtime and makespan minimisation in a permutation flowshop. For this, we introduce a multi-criteria iterated greedy search algorithm. This algorithm iterates over a multicriteria constructive heuristic approach to yield a set of Pareto-efficient solutions (a posteriori approach). The proposed algorithm is compared against the best-so-far heuristic for the problem under consideration. The comparison shows the proposal to be very efficient for a wide number of multicriteria performance measures. Aside, an extensive computational experience is carried out in order to analyse the different parameters of the algorithm. The analysis shows the algorithm to be robust for most of the considered performance measures.