Inserting problem-specific knowledge in multirecombined evolutionary algorithms
In the restricted single-machine common due date problem the goal is to find a schedule for the n jobs which jointly minimizes the sum of earliness and tardiness penalties, while for the weighted tardiness problem the goal is to find a schedule that minimizes the tardiness penalties. Both problems,...
Guardado en:
| Autores principales: | Pandolfi, Daniel, San Pedro, María Eugenia de, Villagra, Andrea, Vilanova, Gabriela, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/22065 |
| Aporte de: |
Ejemplares similares
-
Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001) -
Adaptability of multirecombinated evolutionary algorithms to changing common due dates
por: Pandolfi, Daniel, et al.
Publicado: (2001) -
Optimization of tardiness related objectives in single machine environments via multirecombined evolutionary algorithms
por: San Pedro, María Eugenia de, et al.
Publicado: (2003) -
Enhancing evolutionary algorithms through recombination and parallelism
por: Gallard, Raúl Hector, et al.
Publicado: (2001) -
Hybridizing multi-inver-over evolutionary algorithms with tabu search for the symmetric TSP
por: Bermúdez, Carlos, et al.
Publicado: (2001)