Evolutionary approaches for the parallel task scheduling problem : the representation issue
The problem of how to find a schedule on m > 2 processors of equal capacity that minimises the whole processing time of independent tasks has been shown as belonging to the NP-complete class (Horowitz and Sahni [12]). Evolutionary Algorithms (EAs) have been used in the past to implement the alloc...
Guardado en:
| Autores principales: | Esquivel, Susana Cecilia, Gatica, Claudia R., 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/23332 |
| Aporte de: |
Ejemplares similares
-
A multirecombinative evolutionary approach to solve the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
A genetic approach using direct representation of solution for the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Studying the parallel task scheduling problem with conventional and evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2001) -
Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004) -
A genetic approach using direct representation of solution for parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)