A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

Times Cited: 23 Article English Ruiz, R Univ Politecn Valencia, Dept Estadist {&} Invest Operat Aplicadas {&} Cal, Camino de Vera S-N, Valencia 46021, Spain Cited References Count: 53 975SE ELSEVIER SCIENCE BV PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS AMSTERDAM

After 50 years of research in the field of flowshop scheduling problems the scientific community still observes a noticeable gap between the theory and the practice of scheduling. In this paper we aim to provide a metaheuristic, in the form of a genetic algorithm, to a complex generalized flowshop scheduling problem that results from the addition of unrelated parallel machines at each stage, sequence dependent setup times and machine eligibility. Such a problem is common in the production of textiles and ceramic tiles. The proposed algorithm incorporates new characteristics and four new crossover operators. We show an extensive calibration of the different parameters and operators by means of experimental designs. To evaluate the proposed algorithm we present several adaptations of other well-known and recent metaheuristics to the problem and conduct several experiments with a set of 1320 random instances as well as with real data taken from companies of the ceramic tile manufacturing sector. The results indicate that the proposed algorithm is more effective than all other adaptations. (c) 2005 Elsevier B.V. All rights reserved