 Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup timeRajesh Vanchipura and R. Sridharan International Journal of Services and Operations Management, 2014, vol. 17, issue 2, 168-193 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. Keywords: flow shop scheduling; sequence dependent setup times; SDST; hybrid genetic algorithms; parameter tuning. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:17:y:2014:i:2:p:168-193 Access Statistics for this article More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.