A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
This paper addresses the Flexible Job Shop Scheduling Problem (FJSSP) where the objective is to minimize the makespan. We develop a parallel hybrid Differential Evolution (DE) algorithm to tackle this problem. A random key representation of the FJSSP is adopted, which requires a very simple conversi...
Guardado en:
| Autores principales: | Morero, Franco, Bermúdez, Carlos, Salto, Carolina |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/90890 |
| Aporte de: |
Ejemplares similares
-
Parallelism and Hybridization in Differential Evolution to solve the Flexible Job Shop Scheduling Problem
por: Morero, Franco, et al.
Publicado: (2020) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2001) -
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)