Solving the flow shop scheduling problem under evolutionary approaches
The flow shop scheduling problem (FSSP) [12], 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, late...
Guardado en:
| Autores principales: | Vilanova, Gabriela, Pandolfi, Daniel, San Pedro, María Eugenia de, Villagra, Andrea, Bain, María Elena, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21670 |
| Aporte de: |
Ejemplares similares
-
Different evolutionary approaches to solve the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Inserting knowledge in multirecombined evolutionary algorithms for the flow shop scheduling problem
por: Villagra, Andrea, et al.
Publicado: (2002) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
The role of different crossover methods when solving the open shop scheduling problem via a simple evolutionary approach
por: Beraudo, Vanina, et al.
Publicado: (2002) -
Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002)