Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/921190
- Title
- A parallel memetic algorithm applied to the total tardiness machine scheduling problem
- Author/Creator
-
Garcia, Vinícius Jacques;
França, Paulo Morelato;
de Sousa Mendes, Alexandre;
Moscato, Pablo
- Description
- 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.
- Relation
- 20th International Parallel and Distributed Processing Symposium (IPDPS 2006). Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006) (Rhodes Island, Greece 25 - 29 April, 2006)
- Publisher Link
- http://dx.doi.org/10.1109/IPDPS.2006.1639514
- Date
- 2006
- Publisher
- Institute of Electrical and Electronics Engineers (IEEE)
- Keyword(s)
-
parallel evolutionary algorithm;
parallel genetic algorithm;
parallel memetic algorithm;
total tardiness single machine scheduling problem
- Resource Type
- conference paper
- Rights
- Copyright © 2007 IEEE. Reprinted from the Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Identifier
- http://hdl.handle.net/1959.13/921190
- Identifier
- ISBN:1424400546
- Language
- eng
- Reviewed
- Full Text
-
-
32 Visitors
40 Hits
2 Downloads
List Of Titles
