Development and analysis of hybrid genetic algorithms for flow shop scheduling with sequence dependent setup time Online publication date: Tue, 17-Jun-2014
by Rajesh Vanchipura; R. Sridharan
International Journal of Services and Operations Management (IJSOM), Vol. 17, No. 2, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook