Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines

In this paper we present a comparative study of four trajectory metaheuristics or single-solution based metaheuristics (S-meta heuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS) and Simulated Annealing (SA). The metaheuri...

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: 2012
Materias:
Ciencias Informáticas
Iterated Local Search
Greedy Randomized Adaptive Search Procedure
Variable Neighborhood Search
Simulated Annealing
Parallel Machines Scheduling
Maximum Tardiness
Statistical Nonparametric Tests
Scheduling
Simulation
Parallel
Intelligent agents
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23606
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23606
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
Iterated Local Search
Greedy Randomized Adaptive Search Procedure
Variable Neighborhood Search
Simulated Annealing
Parallel Machines Scheduling
Maximum Tardiness
Statistical Nonparametric Tests
Scheduling
Simulation
Parallel
Intelligent agents
spellingShingle Ciencias Informáticas
Iterated Local Search
Greedy Randomized Adaptive Search Procedure
Variable Neighborhood Search
Simulated Annealing
Parallel Machines Scheduling
Maximum Tardiness
Statistical Nonparametric Tests
Scheduling
Simulation
Parallel
Intelligent agents
Gatica, Claudia R.
Esquivel, Susana Cecilia
Leguizamón, Guillermo
Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
topic_facet Ciencias Informáticas
Iterated Local Search
Greedy Randomized Adaptive Search Procedure
Variable Neighborhood Search
Simulated Annealing
Parallel Machines Scheduling
Maximum Tardiness
Statistical Nonparametric Tests
Scheduling
Simulation
Parallel
Intelligent agents
description In this paper we present a comparative study of four trajectory metaheuristics or single-solution based metaheuristics (S-meta heuristics): Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP), Variable Neighborhood Search (VNS) and Simulated Annealing (SA). The metaheuristics were used to minimize the Maximum Tardiness (Tmax) for unrestricted parallel identical machine scheduling (Pm) problem, which is considered as NP-Hard problem. The results obtained through experimentation show that SA was the best behaved.
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 Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
title_short Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
title_full Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
title_fullStr Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
title_full_unstemmed Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
title_sort comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
publishDate 2012
url http://sedici.unlp.edu.ar/handle/10915/23606
work_keys_str_mv AT gaticaclaudiar comparativestudyoftrajectorymetaheuristicsfortheresolutionofschedulingproblemofunrestrictedparallelidenticalmachines
AT esquivelsusanacecilia comparativestudyoftrajectorymetaheuristicsfortheresolutionofschedulingproblemofunrestrictedparallelidenticalmachines
AT leguizamonguillermo comparativestudyoftrajectorymetaheuristicsfortheresolutionofschedulingproblemofunrestrictedparallelidenticalmachines
bdutipo_str Repositorios
_version_ 1764820466016452610

Ejemplares similares