Imperialist competitive algorithm for the flowshop problem
This article presents a new optimization techniques based on Imperialistic Competitive Algorithm to solve the flowshop scheduling problems, which objective is to minimize the makespan. Furthermore, this approach is enhanced by a local search procedure in order to improve the best solutions. To show...
Guardado en:
| Autores principales: | Minetti, Gabriela F., Salto, Carolina |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/50064 |
| Aporte de: |
Ejemplares similares
-
A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2000) -
A hybrid evolutionary algorithm: multirecombination with priority rule base representation abstract for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2000) -
An immune artificial algorithm for dynamic optimization problems: a case of study
por: Aragón, Victoria S., et al.
Publicado: (2009) -
Contrasting two MCMP alternatives in evolutionary algorithms to solve the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2001) -
An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013)