Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time

Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time

0.00 Avg rating0 Votes
Article ID: iaor2014431
Volume: 17
Issue: 2
Start Page Number: 168
End Page Number: 193
Publication Date: Jan 2014
Journal: International Journal of Services and Operations Management
Authors: ,
Keywords: combinatorial optimization, heuristics: genetic algorithms
Abstract:

This paper deals with the development and analysis of hybrid genetic algorithms for flow shop scheduling problems with sequence dependent setup time. A constructive heuristic called setup ranking algorithm is used for generating the initial population for genetic algorithm. Different variations of genetic algorithm are developed by using combinations of types of initial populations and types of crossover operators. For the purpose of experimentation, 27 group problems are generated with ten instances in each group for flow shop scheduling problems with sequence dependent setup time. An existing constructive algorithm is used for comparing the performance of the algorithms. A full factorial experiment is carried out on the problem instances developed. The best settings of genetic algorithm parameters are identified for each of the groups of problems. The analysis reveals the superior performance of hybrid genetic algorithms for all the problem groups.

Reviews

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