%0 Journal Article %T Modified NSGA-II for a Bi-Objective Job Sequencing Problem %A Susmita Bandyopadhyay %J Intelligent Information Management %P 319-329 %@ 2160-5920 %D 2012 %I Scientific Research Publishing %R 10.4236/iim.2012.46036 %X This paper proposes a better modified version of a well-known Multi-Objective Evolutionary Algorithm (MOEA) known as Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed algorithm contains a new mutation algorithm and has been applied on a bi-objective job sequencing problem. The objectives are the minimization of total weighted tardiness and the minimization of the deterioration cost. The results of the proposed algorithm have been compared with those of original NSGA-II. The comparison of the results shows that the modified NSGA-II performs better than the original NSGA-II. %K Job Sequencing %K Multi-Objective Evolutionary Algorithm (MOEA) %K NSGA-II (Non-Dominated Sorting Genetic Algorithm-II) %K Tardiness %K Deterioration Cost %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=24530