Two new robust genetic algorithms for the flowshop scheduling problem

Two new robust genetic algorithms for the flowshop scheduling problem

0.00 Avg rating0 Votes
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: , ,
Keywords: heuristics: genetic algorithms
Abstract:

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 (Cmax). We show a robust genetic algorithm and a fast hybrid implementation. These algorithms use new genetic operators, advanced techniques like hybridization with local search and an efficient population initialization as well as a new generational scheme. A complete evaluation of the different parameters and operators of the algorithms by means of a Design of Experiments approach is also given. The algorithm's effectiveness is compared against 11 other methods, including genetic algorithms, tabu search, simulated annealing and other advanced and recent techniques. For the evaluations we use Taillard's well known standard benchmark. The results show that the proposed algorithms are very effective and at the same time are easy to implement.

Reviews

Required fields are marked *. Your email address will not be published.