1.
|
Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
Vilanova, Gabriela - Villagra, Andrea - Pandolfi, Daniel - San Pedro, María Eugenia de - Gallard, Raúl Hector
Formato: |
Objeto de conferencia, Objeto de conferencia |
Enlaces: |
In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each operation requires a different machine, so n jobs have to be processed in the same sequence on m machines. The processing time of each job…
|
Fecha: |
2012-10-09 |
Recurso: |
Unversidad Nacional de La Plata |
|