An immune-inspired algorithm for an unrelated parallel machines’ scheduling problem with sequence and machine dependent setup-times for makespan minimisation

Abstract

This paper proposes an immune-inspired algorithm to the problem of minimising the makespan on unrelated parallel machines, with sequence dependent setup times. The initial population is generated through the construction phase of the Greedy Randomised Adaptive Search Procedure (GRASP). An evaluation function is proposed to help the algorithm escape from local optima. A Variable Neighbourhood Descent (VND) local search heuristic, which makes significant use of the characteristics of the problem, is proposed as a somatic hypermutation operator to accelerate the convergence of the algorithm. A population re-selection operator, which strategically keeps good quality solutions with a high level of dispersion in the search space, is also proposed. The experiments performed show that the proposed algorithm enables better results than those reported in recent literature studies.