Abstract
This paper investigates unrelated parallel machine scheduling problems where the objectives are to minimize total weighted sum of earliness/tardiness costs. Three different metaheuristic algorithms are compared with others to determine what kind (swarm intelligence based, evolutionary or single solution) of metaheuristics is effective to solve these problems. In this study, artificial bee colony (ABC), genetic algorithm and simulated annealing algorithm are chosen as swarm intelligence based algorithm, evolutionary algorithm and single solution algorithm. All proposed algorithms are created without modification in order to determine effectiveness of these metaheuristics. Experimental results show that ABC outperforms its opponents in view of solution quality as swarm intelligence based metaheuristic algorithm.
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 callDisclaimer: 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.
