Parallel and sequential evolutionary algorithms for the flow shop scheduling problem
Determining an optimal schedule to m1mm1ze the completion time of the last job abandoning the system (makespan) become a very difficult problem when there are more than two machines in the flow shop. Due both to its economical impact and complexity attention to solve the Flow Shop Scheduling problem...
Guardado en:
| Autores principales: | Esquivel, Susana Cecilia, Printista, Alicia Marcela, Zuppa, Federico, 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/23411 |
| 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) -
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) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
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)