A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times

A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times

0.00 Avg rating0 Votes
Article ID: iaor20112901
Volume: 211
Issue: 3
Start Page Number: 612
End Page Number: 622
Publication Date: Jun 2011
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics: genetic algorithms
Abstract:

In this work a genetic algorithm is presented for the unrelated parallel machine scheduling problem in which machine and job sequence dependent setup times are considered. The proposed genetic algorithm includes a fast local search and a local search enhanced crossover operator. Two versions of the algorithm are obtained after extensive calibrations using the Design of Experiments (DOE) approach. We review, evaluate and compare the proposed algorithm against the best methods known from the literature. We also develop a benchmark of small and large instances to carry out the computational experiments. After an exhaustive computational and statistical analysis we can conclude that the proposed method shows an excellent performance overcoming the rest of the evaluated methods in a comprehensive benchmark set of instances.

Reviews

Required fields are marked *. Your email address will not be published.