The role of different crossover methods when solving the open shop scheduling problem via a simple evolutionary approach
The Open Shop Scheduling Problem (OSSP) is one of the most interesting, complexes and not frequently approached scheduling problems. Due to its intractability with other techniques, in this work we present an evolutionary approach to provide approximate solutions. One of the most important points i...
Guardado en:
| Autores principales: | Beraudo, Vanina, Salto, Carolina, Alfonso, Hugo, Labarere, I., 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/23018 |
| 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) -
Different evolutionary approaches to solve the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Solving the flow shop scheduling problem under evolutionary approaches
por: Vilanova, Gabriela, et al.
Publicado: (2001) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Influence of crossover operators in evolutionary scheduling under multirecombined schemes
por: San Pedro, María Eugenia de, et al.
Publicado: (2003)