Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
In this paper we present a comparative study of four trajectory metaheuristics or single-solution based metaheuristics (S-meta heuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS) and Simulated Annealing (SA). The metaheuri...
Guardado en:
Autores principales: | Gatica, Claudia R., Esquivel, Susana Cecilia, Leguizamón, Guillermo |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Inglés |
Publicado: |
2012
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23606 |
Aporte de: |
Ejemplares similares
-
A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
por: Gatica, Claudia Ruth, et al.
Publicado: (2013) -
Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004) -
Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003) -
Using parallel pivot vs. clustering-based techniques for web engines
por: Gil Costa, Graciela Verónica, et al.
Publicado: (2007) -
An evolutionary approach to the parallel task scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (1999)