In this paper, we present a genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP). The algorithm integrates different strategies for generating the initial population, selecting the individuals for reproduction and reproducing new individuals. Computational result shows that the integration of more strategies in a genetic framework leads to better results, with respect to other genetic algorithms. Moreover, results are quite comparable to those obtained by the best-known algorithm, based on tabu search. These two results, together with the flexibility of genetic paradigm, prove that genetic algorithms are effective for solving FJSP. (C) 2007 Elsevier Ltd. All rights reserved.
A genetic algorithm for flexible job-shop problem / Pezzella, Ferdinando; Ciaschetti, G; Morganti, Gianluca. - In: COMPUTERS & OPERATIONS RESEARCH. - ISSN 0305-0548. - 35, Issue 10 / 2008:(2008), pp. 3202-3212. [10.1016/j.cor.2007.02.014]