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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gatica, Claudia R., Esquivel, Susana Cecilia, Leguizamón, Guillermo
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2008
Materias:
Ciencias Informáticas
Parallel
Scheduling
Optimization
Heuristic methods
Ant Colony Optimization (ACO)
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21771
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-21771
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Parallel
Scheduling
Optimization
Heuristic methods
Ant Colony Optimization (ACO)
spellingShingle Ciencias Informáticas
Parallel
Scheduling
Optimization
Heuristic methods
Ant Colony Optimization (ACO)
Gatica, Claudia R.
Esquivel, Susana Cecilia
Leguizamón, Guillermo
An ACO approach for the Parallel Machines Scheduling Problem
topic_facet Ciencias Informáticas
Parallel
Scheduling
Optimization
Heuristic methods
Ant Colony Optimization (ACO)
description 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 this work, we apply the Ant Colony Optimization (ACO) metaheuristic which includes in the construction solution process different specific heuristic to solve P<sub>m</sub> for the minimization Maximum Tardiness (T<sub>max</sub>). We also present a comparison of previous results obtained by a simple genetic algorithm (GAs) and an evidence of an improved performance of the ACO metaheuristic on this particular scheduling problem.
format Objeto de conferencia
Objeto de conferencia
author Gatica, Claudia R.
Esquivel, Susana Cecilia
Leguizamón, Guillermo
author_facet Gatica, Claudia R.
Esquivel, Susana Cecilia
Leguizamón, Guillermo
author_sort Gatica, Claudia R.
title An ACO approach for the Parallel Machines Scheduling Problem
title_short An ACO approach for the Parallel Machines Scheduling Problem
title_full An ACO approach for the Parallel Machines Scheduling Problem
title_fullStr An ACO approach for the Parallel Machines Scheduling Problem
title_full_unstemmed An ACO approach for the Parallel Machines Scheduling Problem
title_sort aco approach for the parallel machines scheduling problem
publishDate 2008
url http://sedici.unlp.edu.ar/handle/10915/21771
work_keys_str_mv AT gaticaclaudiar anacoapproachfortheparallelmachinesschedulingproblem
AT esquivelsusanacecilia anacoapproachfortheparallelmachinesschedulingproblem
AT leguizamonguillermo anacoapproachfortheparallelmachinesschedulingproblem
AT gaticaclaudiar acoapproachfortheparallelmachinesschedulingproblem
AT esquivelsusanacecilia acoapproachfortheparallelmachinesschedulingproblem
AT leguizamonguillermo acoapproachfortheparallelmachinesschedulingproblem
bdutipo_str Repositorios
_version_ 1764820464882941954

Ejemplares similares