Multirecombination and different representation in evolutionary algorithms for the flow shop scheduling problem
The flow shop scheduling problem (FSSP) has held the attention of many researchers. In a simplest usual situation, a set of jobs must follow the same route to be executed on a set of machines (resources) and the main objective is to optimize some performance variable (makespan, tardiness, lateness,...
Guardado en:
| Autores principales: | Bain, María Elena, Pandolfi, Daniel, Vilanova, Gabriela, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2000
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23455 |
| Aporte de: |
Ejemplares similares
-
Parameter control in multirecombinated evolutionary algorithms for the flow shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2001) -
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002) -
A comparison of two multirecombinated evolutionary algorithms for the job shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2000) -
An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2002) -
A hybrid evolutionary algorithm: multirecombination with priority rule base representation abstract for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2000)