Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
The study of earliness and tardiness penalties in scheduling is a relatively recent area of research. In the past, traditionally the emphasis was put on regular measures that are nondecreasing in job completion times such as makespan, mean lateness, percentage of tardy jobs or mean tardiness. Curren...
Guardado en:
| Autores principales: | San Pedro, María Eugenia de, Pandolfi, Daniel, Villagra, Andrea, Vilanova, Gabriela, 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/21657 |
| Aporte de: |
Ejemplares similares
-
Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001) -
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002) -
Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002) -
Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)