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

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

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Gatica, Claudia Ruth, Esquivel, Susana Cecilia, Leguizamón, Guillermo
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2013
Materias:	Ciencias Informáticas Informática unrestricted parallel identical machines scheduling problem maximum tardiness simulating annealing Simulation Scheduling Benchmarks
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/31566
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-31566
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 Informática unrestricted parallel identical machines scheduling problem maximum tardiness simulating annealing Simulation Scheduling Benchmarks
spellingShingle	Ciencias Informáticas Informática unrestricted parallel identical machines scheduling problem maximum tardiness simulating annealing Simulation Scheduling Benchmarks Gatica, Claudia Ruth Esquivel, Susana Cecilia Leguizamón, Guillermo A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
topic_facet	Ciencias Informáticas Informática unrestricted parallel identical machines scheduling problem maximum tardiness simulating annealing Simulation Scheduling Benchmarks
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.
format	Objeto de conferencia Objeto de conferencia
author	Gatica, Claudia Ruth Esquivel, Susana Cecilia Leguizamón, Guillermo
author_facet	Gatica, Claudia Ruth Esquivel, Susana Cecilia Leguizamón, Guillermo
author_sort	Gatica, Claudia Ruth
title	A variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
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	variant of simulated annealing to solve unrestricted identical parallel machine scheduling problems
publishDate	2013
url	http://sedici.unlp.edu.ar/handle/10915/31566
work_keys_str_mv	AT gaticaclaudiaruth avariantofsimulatedannealingtosolveunrestrictedidenticalparallelmachineschedulingproblems AT esquivelsusanacecilia avariantofsimulatedannealingtosolveunrestrictedidenticalparallelmachineschedulingproblems AT leguizamonguillermo avariantofsimulatedannealingtosolveunrestrictedidenticalparallelmachineschedulingproblems AT gaticaclaudiaruth variantofsimulatedannealingtosolveunrestrictedidenticalparallelmachineschedulingproblems AT esquivelsusanacecilia variantofsimulatedannealingtosolveunrestrictedidenticalparallelmachineschedulingproblems AT leguizamonguillermo variantofsimulatedannealingtosolveunrestrictedidenticalparallelmachineschedulingproblems
bdutipo_str	Repositorios
_version_	1764820471309664259

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

Ejemplares similares