Robust parameter design for genetic algorithm to bicriteria open-shop scheduling problems Online publication date: Wed, 14-Oct-2009
by Hong Tau Lee, Jin Hong Lin, Sheu Hua Chen
International Journal of Experimental Design and Process Optimisation (IJEDPO), Vol. 1, No. 1, 2009
Abstract: The minimised sum of makespan and total tardiness of an open-shop scheduling problem for a set of jobs with non-identical ready times are considered. A genetic algorithm is employed to solve this problem. The fitness function comprises both the modified makespan and total tardiness, thus avoiding the effect of a dominating criterion. A variable weighting approach for the two criteria is utilised to alter the search directions of each generation and accelerate convergence of the algorithm. An experimental design is employed to determine the best combination of parameter levels that can then be adopted in the genetic algorithm. Finally, the proposed genetic algorithm is implemented using the data of case company. The results show that the schedule generated by the proposed genetic algorithm outperforms the company's current FCFS with SPT scheduling approach in terms of makespan and total tardiness as well as number of tardy jobs.
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 Experimental Design and Process Optimisation (IJEDPO):
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