Article ID: | iaor2008195 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 5 |
Start Page Number: | 461 |
End Page Number: | 476 |
Publication Date: | Oct 2006 |
Journal: | OMEGA |
Authors: | Maroto Concepcin, Ruiz Rubn, Alcaraz Javier |
Keywords: | heuristics: genetic algorithms |
The flowshop scheduling problem (FSP) has been widely studied in the literature and many techniques for its solution have been proposed. Some authors have concluded that genetic algorithms are not suitable for this hard, combinatorial problem unless hybridization is used. This work proposes new genetic algorithms for solving the permutation FSP that prove to be competitive when compared to many other well known algorithms. The optimization criterion considered is the minimization of the total completion time or makespan (