Servicios Personalizados
Revista
Articulo
Indicadores
Citado por SciELO
Accesos
Links relacionados
Citado por Google
Similares en SciELO
Similares en Google
Compartir
Ingeniería y Desarrollo
versión impresa ISSN 0122-3461versión On-line ISSN 2145-9371
Resumen
ALVAREZ MARTINEZ, David; TORO OCAMPO, Eliana Mirledy y GALLEGO RENDON, Ramón Alfonso. A Computational Study Solving the Flow Shop Problem with Annealing-Based Heuristics. Ing. Desarro. [online]. 2009, n.25, pp.154-179. ISSN 0122-3461.
Task sequencing is a daily job of many companies of the products sector and services, where it is sought to optimize one or several objectives. It is proposed here to minimize the total execution time of all tasks. This document presents the results of an extensive computational study of eleven heuristics based on annealing: Simulated Annealing, Threshold Accepting, Record-to-Record and 8 heuristics based on demon algorithms. To validate the quality of the answers, test cases of the specialized literature are used and the results obtained were compared in the quality of the solution and run times.
Palabras clave : Demons algorithms; flow-shop; heuristics; simulated annealing; sequencing of tasks.