SciELO - Scientific Electronic Library Online

 
 issue25Simulation of cyclic triaxial tests with constant and variable confining pressure using empirical equationsAssessment of functions seismic vulnerability of earth building author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Ingeniería y Desarrollo

Print version ISSN 0122-3461On-line version ISSN 2145-9371

Abstract

ALVAREZ MARTINEZ, David; TORO OCAMPO, Eliana Mirledy  and  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.

Keywords : Demons algorithms; flow-shop; heuristics; simulated annealing; sequencing of tasks.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License