Abstract
Parallel machine scheduling problems are classified as NP-hard problems. The direct solutions for these problems are not available and meta-heuristic algorithms are required to be used to find near-optimal solutions. In this paper, the formulations of multi-objective Artificial Bee Colony algorithm by using combination of weighted objectives, secondary storage for managing possible solutions and Genetic algorithm have been developed and applied to schedule jobs on parallel machines optimizing bi-criteria namely maximum tardiness and weighted flow time. The results obtained indicate that proposed algorithm outperforms other multi-objective algorithms in optimizing bi-criteria scheduling problems on parallel machines. Further, the sequential optimization of bi-criteria using Early Due Date (EDD) followed by Genetic Algorithm (GA) has also been investigated. The efficiencies of the proposed algorithms have been verified by numerical illustrations and statistical tests.
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 Applied Evolutionary Computation
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.
