Hybrid genetic algorithm for multi-objective flow shop scheduling problem with sequence dependent setup time: parameter design using Taguchi's robust design method
by Anjana Viswanath; R. Sridharan; P.N. Ram Kumar
International Journal of Process Management and Benchmarking (IJPMB), Vol. 9, No. 4, 2019

Abstract: This paper determines optimal parameters of the proposed hybrid genetic algorithm for solving the multi-objective flow shop scheduling problem with sequence dependent setup time. The objectives considered in this study are minimisation of makespan and mean tardiness. In order to achieve these objectives, genetic algorithm is used in combination with a local search method to obtain Pareto-optimal solutions. The best parameters of the proposed algorithm are determined using the Taguchi's robust design method and the concept of utility index value. The set of parameters corresponding to the highest utility value is selected as the optimal parameters for the proposed algorithm. The analysis of results reveals that crossover type is the most influential parameter. The other parameters in the order of importance are mutation probability, crossover probability, mutation type and initial population. The hybrid genetic algorithm is applied to the benchmark problems of flow shop scheduling with sequence dependent setup time.

Online publication date: Wed, 06-Nov-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Process Management and Benchmarking (IJPMB):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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