A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems

Autores
Gatica, Claudia Ruth; Esquivel, Susana Cecilia; Leguizamón, Guillermo
Año de publicación
2013
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
In this paper we propose a modification to the Simulated Annealing (SA) basic algorithm that includes an additional local search cycle after finishing every Metropolis cycle. The added search finishes when it improves the current solution or after a predefined number of tries. We applied the algorithm to minimize the Maximum Tardiness objective for the Unrestricted Parallel Identical Machines Scheduling Problem for which no benchmark have been found in the literature. In previous studies we found, by using Genetic Algorithms, solutions for some adapted instances corresponding to Weighted Tardiness problem taken from the OR-Library. The aim of this work is to find improved solutions (if possible) to be considered as the new benchmark values and make them available to the community interested in scheduling problems. Evidence of the improvement obtained with proposed approach is also provided.
XIV Workshop agentes y sistemas inteligentes.
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Informática
unrestricted parallel identical machines scheduling problem
maximum tardiness
simulating annealing
Simulation
Scheduling
Benchmarks
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/31566
Acceder
id SEDICI_dd768a0e347cd074ea882c124912b284
oai_identifier_str oai:sedici.unlp.edu.ar:10915/31566
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problemsGatica, Claudia RuthEsquivel, Susana CeciliaLeguizamón, GuillermoCiencias InformáticasInformáticaunrestricted parallel identical machines scheduling problemmaximum tardinesssimulating annealingSimulationSchedulingBenchmarksIn this paper we propose a modification to the Simulated Annealing (SA) basic algorithm that includes an additional local search cycle after finishing every Metropolis cycle. The added search finishes when it improves the current solution or after a predefined number of tries. We applied the algorithm to minimize the Maximum Tardiness objective for the Unrestricted Parallel Identical Machines Scheduling Problem for which no benchmark have been found in the literature. In previous studies we found, by using Genetic Algorithms, solutions for some adapted instances corresponding to Weighted Tardiness problem taken from the OR-Library. The aim of this work is to find improved solutions (if possible) to be considered as the new benchmark values and make them available to the community interested in scheduling problems. Evidence of the improvement obtained with proposed approach is also provided.XIV Workshop agentes y sistemas inteligentes.Red de Universidades con Carreras en Informática (RedUNCI)2013-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/31566enginfo: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:50:34Zoai:sedici.unlp.edu.ar:10915/31566Institucionalhttp://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:50:34.234SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
title A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
spellingShingle A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
Gatica, Claudia Ruth
Ciencias Informáticas
Informática
unrestricted parallel identical machines scheduling problem
maximum tardiness
simulating annealing
Simulation
Scheduling
Benchmarks
title_short A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
title_full A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
title_fullStr A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
title_full_unstemmed A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
title_sort A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
dc.creator.none.fl_str_mv Gatica, Claudia Ruth
Esquivel, Susana Cecilia
Leguizamón, Guillermo
author Gatica, Claudia Ruth
author_facet Gatica, Claudia Ruth
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
Informática
unrestricted parallel identical machines scheduling problem
maximum tardiness
simulating annealing
Simulation
Scheduling
Benchmarks
topic Ciencias Informáticas
Informática
unrestricted parallel identical machines scheduling problem
maximum tardiness
simulating annealing
Simulation
Scheduling
Benchmarks
dc.description.none.fl_txt_mv In this paper we propose a modification to the Simulated Annealing (SA) basic algorithm that includes an additional local search cycle after finishing every Metropolis cycle. The added search finishes when it improves the current solution or after a predefined number of tries. We applied the algorithm to minimize the Maximum Tardiness objective for the Unrestricted Parallel Identical Machines Scheduling Problem for which no benchmark have been found in the literature. In previous studies we found, by using Genetic Algorithms, solutions for some adapted instances corresponding to Weighted Tardiness problem taken from the OR-Library. The aim of this work is to find improved solutions (if possible) to be considered as the new benchmark values and make them available to the community interested in scheduling problems. Evidence of the improvement obtained with proposed approach is also provided.
XIV Workshop agentes y sistemas inteligentes.
Red de Universidades con Carreras en Informática (RedUNCI)
description In this paper we propose a modification to the Simulated Annealing (SA) basic algorithm that includes an additional local search cycle after finishing every Metropolis cycle. The added search finishes when it improves the current solution or after a predefined number of tries. We applied the algorithm to minimize the Maximum Tardiness objective for the Unrestricted Parallel Identical Machines Scheduling Problem for which no benchmark have been found in the literature. In previous studies we found, by using Genetic Algorithms, solutions for some adapted instances corresponding to Weighted Tardiness problem taken from the OR-Library. The aim of this work is to find improved solutions (if possible) to be considered as the new benchmark values and make them available to the community interested in scheduling problems. Evidence of the improvement obtained with proposed approach is also provided.
publishDate 2013
dc.date.none.fl_str_mv 2013-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/31566
url http://sedici.unlp.edu.ar/handle/10915/31566
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_ 1846063938900328448
score 13.22299

Publicaciones similares