A genetic algorithm with neighborhood search procedures for unrelated parallel machine scheduling problem with sequence-dependent setup times

Abstract

PurposeThe purpose of this paper is to present a hybrid meta-heuristic based on genetic algorithms (GAs), simulated annealing, variable neighborhood descent and path relinking for solving the variant of the unrelated parallel machine scheduling problem considering sequence-dependent setup times.Design/methodology/approachThe authors carried out computational experiments on literature problem instances proposed by Vallada and Ruiz (2011) and Arnaoutet al.(2010) to test the performance of the proposed meta-heuristic. The objective function adopted was makespan minimization, and the authors used relative deviation, average and population standard deviation as performance criteria.FindingsThe results indicate the competitivity of the proposed approach and its superiority in comparison with several other algorithms. In small instances proposed by Vallada and Ruiz (2011) and on small and large instances proposed by Arnaoutet al.(2010), the proposed approach presented the best results in most tested problem instances.Practical implicationsIn small instances proposed by Vallada and Ruiz (2011) and on small and large instances proposed by Arnaoutet al.(2010), the proposed approach presented the best results in most tested problem instances.Originality/valueThe proposed approach presented high-quality results, with an innovative hybridization of a GA and neighborhood search algorithms, tested in diverse instances of literature. Furthermore, the case study demonstrated that the proposed approach is recommended for solving real-world problems.