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...

Descripción completa

Guardado en:
Detalles Bibliográficos
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