Scheduling unrelated parallel machines with set-up consideration applying GA and response surface method Online publication date: Sat, 27-Dec-2014
by Wen-Pai Wang; Chun-Chih Chiu
International Journal of Services Operations and Informatics (IJSOI), Vol. 7, No. 2/3, 2012
Abstract: This paper presents a Genetic Algorithm (GA) combining with response surface method to solve Unrelated Parallel Machine Scheduling Problems (UPMSP) with set-up times. It focuses on different service times to consider the set-up times for scheduling problems resulted from different type of orders so as to find out the minimal total completion time. Initially the GA is applied to determine processing sequence of orders on unrelated parallel machines. Results have shown that the approach can quickly discover the approximate optimal solution. In view of the fact that parameter setting makes a significant impact on many algorithms, this paper combines experimental design with response surface method to determine related parameter level combination for GAs. The results show that suchlike combination resolved by response surface method achieve better quality and fewer times of experiment, thus enhancing resolved quality for GAs.
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 Operations and Informatics (IJSOI):
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