Parallelism and Hybridization in Differential Evolution to solve the Flexible Job Shop Scheduling Problem
The Flexible Job Shop Scheduling Problem (FJSSP) is one of the most challenging combinatorial optimization problems, with practical applicability in a real production environment. In this work, we propose a simple Differential Evolution (DE) algorithm to tackle this problem. To represent a FJSSP sol...
Guardado en:
| Autores principales: | Morero, Franco, Bermúdez, Carlos, Salto, Carolina |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/97202 |
| Aporte de: |
Ejemplares similares
-
A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
por: Morero, Franco, et al.
Publicado: (2019) -
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Programación de la producción a corto plazo y de tareas de mantenimiento preventivo en ambientes "job shop" flexibles
por: Sirolla, Mauricio D., et al.
Publicado: (2014)