An ACO approach for the Parallel Machines Scheduling Problem
The parallel machines scheduling problem (Pm) comprises the allocation of jobs on the system’s resources, i.e., a group of machines in parallel. The basic model consists of m identical machines and n jobs. The jobs are assigned according to resource availability following some allocation rule. In th...
Guardado en:
| Autores principales: | Gatica, Claudia R., Esquivel, Susana Cecilia, Leguizamón, Guillermo |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2008
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21771 |
| Aporte de: |
Ejemplares similares
-
Broker Scheduler based on ACO for Federated Cloud-based scientific experiments
por: Pacini, E., et al. -
Broker Scheduler based on ACO for Federated Cloud-based scientific experiments
Publicado: (2016) -
An ant colony optimization algorithm for job shop scheduling problem
por: Flórez, Edson, et al.
Publicado: (2013) -
Current applications of ant systems for subset problems
por: Leguizamón, Guillermo
Publicado: (2000) -
Optimización de rutas en el transporte de personas para la pequeña y mediana empresa
por: Villagra, Andrea, et al.
Publicado: (2016)