Studs, seeds and immigrants in evolutionary algorithms for unrestricted parallel machine scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3315, Issue , 2014, Pages 174-184

  Ferretti, E ^a   Esquivel, S ^a   Gallara R ^a  

^a UNIVERSIDAD NACIONAL DE SAN LUIS   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS; MACHINERY; STUDS (FASTENERS); STUDS (STRUCTURAL MEMBERS);

ALLOCATION RULE; COMPLEX MODEL; MULTIRECOMBINATION; PARALLEL MACHINE SCHEDULING; PARALLEL MACHINE-SCHEDULING PROBLEMS; PROBLEM-SPECIFIC KNOWLEDGE; RESOURCE AVAILABILITY; SYSTEM RESOURCES;

SCHEDULING;

EID: 84942594986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. J.E. Beasley “Weighted Tardiness”, OR Library, “http://mscmga.ms.ic.ac.uk/”
2. H.A.J. Crauwels, C.N. Potts and L.N. Van Wassenhove, “Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem”, Informs Journal on Computing 10, pp. 341-350, 1998.
3. Eiben A.E., Raué P.E., and Ruttkay Z., “Genetic Algorithms with Multi-parent Recombination”, Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, number 866 in LNCS, pp. 78-87, Springer-Verlag, 1994.
4. Eiben A.E., Van Kemenade C.H.M., and Kok J.N., “Orgy in the Computer: Multiparent Reproduction in Genetic Algorithms”, Proceedings of the 3rd European Conference on Artificial Life, number 929 in LNAI, pp. 934-945, Springer-Verlag, 1995.
5. Eiben A.E. and. Bäck, T., “An Empirical Investigation of Multi-parent Recombination Operators in Evolution Strategies”, Evolutionary Computation, 5(3):347-365, 1997.
6. Esquivel S., Leiva A., Gallard R., “Multiple Crossover per Couple in Genetic Algorithms”, Evolutionary Computation (ICEC’97), IEEE Publishing Co, pp. 103-106, ISBN 0-78033949-5, Indianapolis, USA, April 1997.
7. Esquivel S., Leiva A., Gallard, R., “Couple Fitness Based Selection with Multiple Crossover Per Couple in Genetic Algorithms”, Proceedings del International Symposium on Engineering of Intelligent Systems, University of La Laguna, España, Tenerife, Vol. 1, pp 235-241, ISBN 3-906454-12-6, February 1998.
8. Esquivel S., Leiva H., Gallard, R., “Multiple Crossovers between Multiple Parents to Improve Search in Evolutionary Algorithms”, Evolutionary Computation, IEEE Publishing Co, Washington DC, pp. 1589-1594, 1999.
9. Esquivel S., Ferrero S., Gallard R., Salto C., Alfonso H. and Schütz M., “Enhanced Evolutionary Algorithms for Single and Multiobjective Optimization in the Job Shop Scheduling Problem”, Knowledge-Based Systems 15 (2002), pp. 13-25.
10. Feltl H. and Raidl G., “An Improved Hybrid Genetic Algorithm for the Generalized Assignment Problem”, In Proceedings of the 2004 ACM symposium on Applied computing, Nicosia, Cyprus, ECO, pp. 990-995, ISBN:1-58113-812-1, 2004.
11. Min Liu and Cheng Wu, “Scheduling Algorithm based on Evolutionary Computing in Identical Parallel Machine Production Line”, Robotics and Computer-Integrated Manufacturing 19 (2003), pp. 401-407.
12. Morton T., Pentico, D., “Heuristic Scheduling Systems”, Wiley series in Engineering and technology management, John Wiley and Sons, INC, 1993.
13. Pandolfi D., Vilanova G., De San Pedro M., Villagra A., Gallard R., “Multirecombining Studs and Immigrants in Evolutionary Algorithm to face Earliness-Tardiness Scheduling Problems”, In Proceedings of the International Conference in Soft Computing, pp. 138, University of Paisley, Scotland, U.K., June 2001.
14. Pandolfi D., De San Pedro M., Villagra A, Vilanova G., Gallard R., “Studs Mating Immigrants in Evolutionary Algorithm to Solve the Earliness-Tardiness Scheduling Problem”, In Cybernetics and Systems of Taylor and Francis Journal, Vol.33 No. 4, pp. 391-400 (U.K.), June 2002.
15. Pandolfi D., De San Pedro M., Villagra A., Vilanova G., Gallard R., “Multirecombining Random and Seed Immigrants in Evolutionary Algorithms to Solve W-T Scheduling Problems”, In proceedings of CSITeA02, pp 133-138, Iguazu Falls, Brazil, June 2002.
16. Pinedo M., “Scheduling: Theory, Algorithms and System”, Prentice Hall, First edition, 1995