Proposing modified NSGA-II to solve a job sequencing problem

Abstract

In this paper, a bi-objective job sequencing problem is proposed. The objectives are - 1) total weighted tardiness of jobs and 2) total deterioration cost. The proposed problem has been solved by a modified version of the original Nondominated Sorting Genetic Algorithm-II (NSGA-II) which is one of the commonly applied Multi-Objective Evolutionary Algorithm in the existing literature. NSGA-II has been modified by introducing a novel mutation algorithm that has been embedded in the original NSGA-II. The experimental results show the Pareto optimal solutions and conclusions are drawn based on the results. © 2013 Springer.