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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Applications in Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
