Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Cited by Google
- Similars in SciELO
- Similars 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.