An improved ant colony algorithm for the job shop scheduling problem
Instances of static scheduling problems can be easily represented as graphs where each node represents a particular operation. This property makes the Ant Colony Algorithms well suited for different kinds of scheduling problems. In this paper we present an improved Ant System for solving the Job Sho...
Guardado en:
| Autores principales: | Leguizamón, Guillermo, Schutz, Martín |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/23004 |
| Aporte de: |
Ejemplares similares
-
An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013) -
Upgrading evolutionary algorithms through multiplicity for multiobjective optimization in job shop scheduling problems
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000)