Optimisation of genetic algorithm parameters in flow shop scheduling using grey relational analysis
by B. Shahul Hamid Khan, Kannan Govindan, R. Jeyapaul
International Journal of Advanced Operations Management (IJAOM), Vol. 2, No. 1/2, 2010

Abstract: This paper considers permutation flow shop scheduling problem with the objective of minimising the weighted sum of makespan and maximum tardiness, where the maximum tardiness is limited by a given upper bound value. This is NP hard problem in strong sense. A few attempts have been made to obtain good heuristic solutions to this problem. We have reviewed the related literature and propose a new hybrid genetic algorithm for the problem of considerations. A complete evaluation of the different parameters and operators of the algorithm using grey relational analysis in Taguchi method is also given. The evaluation of the hybrid algorithm is carried by 30 randomly generated small and large size problems with 900 instances. Computational experiments indicate that the proposed algorithm is much better than the existing ones.

Online publication date: Tue, 10-Aug-2010

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 Advanced Operations Management (IJAOM):
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