Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem

摘要

A Scatter Search algorithm together with an enriched Scatter Search and an enriched Iterated Greedy for the unrelated parallel machine problem with one additional resource are proposed in this paper. The optimisation objective is to minimise the maximum completion of the jobs on the machines, that is, the makespan. All the proposed methods start from the best known heuristic for the same problem. Non feasible solutions are allowed in all the methods and a Repairing Mechanism is applied to obtain a feasible solution from a resource constraint point of view. All the proposed algorithms apply different local search procedures based on insertion, swap and restricted neighbourhoods. Computational experiments are carried out using an exhaustive benchmark of instances. After analysing the results, we can conclude that the enriched methods obtain superior results, outperforming the best known solutions for the same problem. (C) 2019 Elsevier Ltd. All rights reserved.