Multiobjective evolutionary algorithms for job shop scheduling
A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessarily the same for each job. Job Shop Scheduling (JSS) attempts to provide optimal schedules according to some criterion. Common variables to optimize are makespan, machine idleness, lateness and total w...
Guardado en:
| Autores principales: | Esquivel, Susana Cecilia, Gallard, Raúl Hector, Ferrero, Sergio W. |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21667 |
| Aporte de: |
Ejemplares similares
-
Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2001) -
Multiple crossovers on multiple parents for the multiobjective flow shop problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2002)