A Computational Study Solving the Flow Shop Problem with Annealing-Based Heuristics
Abstract
AbstractTask 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.
How to Cite
[1]
D. Álvarez Martínez, E. M. Toro Ocampo, and R. A. Gallego Rendón, “A Computational Study Solving the Flow Shop Problem with Annealing-Based Heuristics”, Ing. y Des., vol. 25, no. 25, Jun. 2011.
Issue
Section
Articles