A parallel memetic algorithm applied to the total tardiness machine scheduling problem

Authors:
Vinícius Jacques Garcia;Paulo Morelato França;Alexandre de Sousa Mendes;Pablo Moscato
Affiliations:
Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Campinas, SP, Brazil;Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, Campinas, SP, Brazil;School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, NSW, Australia;School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, NSW, Australia
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 4
Cited 0

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Scheduling in a sequence dependent setup environment with genetic search

Computers and Operations Research - Special issue on genetic algorithms
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy

Proceedings of the 3rd International Conference on Genetic Algorithms
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work proposes a parallel memetic algorithm applied to the total tardiness single machine scheduling problem. Classical models of parallel evolutionary algorithms and the general structure of memetic algorithms are discussed. The classical model of global parallel genetic algorithm was used to model the global parallel memetic analogue where the parallelization is only applied to the individual optimization phase of the algorithm. Computational tests show the efficiency of the parallel approach when compared to the sequential version. A set of eight instances, with sizes ranging from 56 up to 323 jobs and with known optimal solutions, is used for the comparisons.