Simulated annealing and genetic algorithm for unrelated parallel machine scheduling considering set-up times Online publication date: Fri, 16-Jun-2006
by Dong-Won Kim, Dong-Gil Na, Wooseung Jang, F. Frank Chen
International Journal of Computer Applications in Technology (IJCAT), Vol. 26, No. 1/2, 2006
Abstract: This paper presents the comparative use of Simulated Annealing (SA) and Genetic Algorithm (GA) in a scheduling problem of unrelated parallel machines with set-up times. The problem accounts for allotting batched work parts to the unrelated parallel machines, where each batch is composed of a fixed number of identical jobs. Processing time of each job of a batch is determined according to the machine group as well as the batch group to which the job belongs. Major or minor set-up times are required between two subsequent batches, depending on the batch sequence but yet independent of machines. The objective of the problem is to minimise the Total Weighted Tardiness (TWT) for the unrelated parallel machine scheduling. SA and GA algorithms are proposed to obtain near-optimal solutions of the problem. The performance of proposed heuristics is compared through computational experiments with real data from dicing operations of a compound semiconductor manufacturing facility.
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 Computer Applications in Technology (IJCAT):
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