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

Autores
Gatica, Claudia R.; Esquivel, Susana Cecilia; Leguizamón, Guillermo
Año de publicación
2012
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Eje: Workshop Agentes y sistemas inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
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
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/23606
Acceder
id SEDICI_94179995e8856684e7c90fa20e85e060
oai_identifier_str oai:sedici.unlp.edu.ar:10915/23606
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machinesGatica, Claudia R.Esquivel, Susana CeciliaLeguizamón, GuillermoCiencias InformáticasIterated Local SearchGreedy Randomized Adaptive Search ProcedureVariable Neighborhood SearchSimulated AnnealingParallel Machines SchedulingMaximum TardinessStatistical Nonparametric TestsSchedulingSimulationParallelIntelligent agentsIn 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.Eje: Workshop Agentes y sistemas inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2012-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/23606enginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T10:48:09Zoai:sedici.unlp.edu.ar:10915/23606Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 10:48:09.676SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
title Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
spellingShingle Comparative study of trajectory metaheuristics for the resolution of scheduling problem of unrestricted parallel identical machines
Gatica, Claudia R.
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
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
dc.creator.none.fl_str_mv Gatica, Claudia R.
Esquivel, Susana Cecilia
Leguizamón, Guillermo
author Gatica, Claudia R.
author_facet Gatica, Claudia R.
Esquivel, Susana Cecilia
Leguizamón, Guillermo
author_role author
author2 Esquivel, Susana Cecilia
Leguizamón, Guillermo
author2_role author
author
dc.subject.none.fl_str_mv 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
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
dc.description.none.fl_txt_mv 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.
Eje: Workshop Agentes y sistemas inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2012
dc.date.none.fl_str_mv 2012-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/23606
url http://sedici.unlp.edu.ar/handle/10915/23606
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846063908839751680
score 13.22299

Publicaciones similares