Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
Determining an optimal schedule to minimize the completion time of the last job abandoning the system (makespan) becomes a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and complexity, different techniques to solve the Flow Shop Sche...
Guardado en:
| Autores principales: | Villagra, Andrea, Vilanova, Gabriela, Pandolfi, Daniel, San Pedro, María Eugenia de, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23045 |
| Aporte de: |
Ejemplares similares
-
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Multirecombination and different representation in evolutionary algorithms for the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000) -
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2001)