Contrasting two MCMP alternatives in evolutionary algorithms to solve the job shop scheduling problem
Many researchers have shown interest to solve the job shop scheduling problem (JSSP) applying evolutionary algorithms (EAs). In a previous work we reported an enhanced evolutionary algorithm, which uses a multiplicity feature to solve JSSP. The evolutionary approach was enhanced by means of multiple...
Guardado en:
| Autores principales: | Stark, Natalia, Salto, Carolina, Alfonso, Hugo, 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/23413 |
| Aporte de: |
Ejemplares similares
-
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
An analysis on selection methods and multirecombination in evolutionary search when solving the job shop scheduling problem
por: Stark, Natalia, et al.
Publicado: (2002) -
Multirecombination and different representation in evolutionary algorithms for the flow shop scheduling problem
por: Bain, María Elena, et al.
Publicado: (2000) -
Parallel and sequential evolutionary algorithms for the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)