Bi-objective Optimization in Identical Parallel Machine Scheduling Problem
This paper presents bi-objective identical parallel machine scheduling problem with minimization of weighted sum of makespan and number of tardy jobs simultaneously. It is a known fact that identical parallel machine scheduling problem with makespan and number of tardy jobs based criteria is NP hard. Metaheuristics has become most important choice for solving NP hard problems because of their multi-solution and strong neighborhood search capabilities in a reasonable time. In this work Simulated Annealing Algorithm (SA) and Genetic Algorithm (GA) has been proposed to optimize two different objectives namely (i) minimization of make span (ii) minimization of number of tardy jobs using combined objective function (COF). The effectiveness of the proposed algorithm have been analyzed by means of benchmark problem taken from the literatures and relative performance measures for the algorithm have also been computed and analyzed. Computational results show that GA outperforms SA by a considerable margin.
KeywordsIdentical parallel machine scheduling Genetic Algorithm Simulated Annealing Algorithm make span number of tardy jobs
Unable to display preview. Download preview PDF.
- 1.Pinedo, M.L.: Scheduling: Theory, Algorithms and Systems. Springer (2012)Google Scholar
- 17.Samur, S., Bulkan, S.: An Evolutionary Solution to a Multi-objective Scheduling Problem. In: Proceedings of the World Congress on Engineering, London, UK, June 30-July 02, vol. 3 (2010)Google Scholar