Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms
Scheduling is an active area of research in applied artificial intelligence. Scheduling problems typically comprise several concurrent (and often conflicting) goals, and several resources which may be allocated in order to satisfy these goals. In many cases, the combination of goals and resources re...
Guardado en:
| Autores principales: | Minetti, Gabriela F., Hugo, Alfonso, 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/21671 |
| Aporte de: |
Ejemplares similares
-
Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003) -
Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002) -
Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2001)