A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
In this paper we propose a modification to the Simulated Annealing (SA) basic algorithm that includes an additional local search cycle after finishing every Metropolis cycle. The added search finishes when it improves the current solution or after a predefined number of tries. We applied the algorit...
Guardado en:
| Autores principales: | Gatica, Claudia Ruth, Esquivel, Susana Cecilia, Leguizamón, Guillermo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/31566 |
| Aporte de: |
Ejemplares similares
-
Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
por: Gatica, Claudia R., et al.
Publicado: (2012) -
Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003) -
Evolutionary optimization of due date based objectives in unrestricted identical parallel machine scheduling problems
por: Ferretti, Edgardo, et al.
Publicado: (2004) -
Designing a Multi-Period Water Distribution Network with a Hybrid Simulated Annealing
por: Bermúdez, Carlos, et al.
Publicado: (2019) -
Aerospace Manufacturing Industry: A Simulation-based Decision Support Framework for the Scheduling of Complex Hoist Lines
por: Basán, Natalia P., et al.
Publicado: (2015)