Adaptability of multirecombinated evolutionary algorithms to changing common due dates
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. This problem, even in its simplest formulation, is an NP-Hard optimization problem. New trends to enhance evolutionary algor...
Guardado en:
| Autores principales: | Pandolfi, Daniel, Vilanova, Gabriela, San Pedro, María Eugenia de, Villagra, Andrea, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21650 |
| Aporte de: |
Ejemplares similares
-
Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001) -
A multirecombinative evolutionary approach to solve the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002) -
Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004) -
Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
por: Villagra, Andrea, et al.
Publicado: (2002)