Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2015-12-09T15:27:21Z
dc.date.available 2015-12-09T15:27:21Z
dc.date.issued 2015
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/50064
dc.description.abstract This article presents a new optimization techniques based on Imperialistic Competitive Algorithm to solve the flowshop scheduling problems, which objective is to minimize the makespan. Furthermore, this approach is enhanced by a local search procedure in order to improve the best solutions. To show the efficiency of the proposed methods, we consider many instances of increasing complexity for the flowshop problem. Computational tests are presented and comparisons between the two approaches are made. The analysis of the results suggests that the enhanced approach is capable to find the best solutions of the problem at hand. es
dc.language en es
dc.subject Optimization es
dc.subject flowshop es
dc.title Imperialist competitive algorithm for the flowshop problem en
dc.type Objeto de conferencia es
sedici.identifier.isbn 978-987-3806-05-6 es
sedici.creator.person Minetti, Gabriela F. es
sedici.creator.person Salto, Carolina es
sedici.description.note XVI Workshop Agentes y Sistemas Inteligentes (WASI) es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2015-10
sedici.relation.event XXI Congreso Argentino de Ciencias de la Computación (Junín, 2015) es
sedici.relation.isRelatedWith http://sedici.unlp.edu.ar/handle/10915/50028 es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (209.7Kb) - PDF

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)