Modified NSGA-II for a Bi-Objective Job Sequencing Problem

HTML  Download Download as PDF (Size: 239KB)  PP. 319-329  
DOI: 10.4236/iim.2012.46036    4,146 Downloads   6,939 Views  Citations

ABSTRACT

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.

Share and Cite:

S. Bandyopadhyay, "Modified NSGA-II for a Bi-Objective Job Sequencing Problem," Intelligent Information Management, Vol. 4 No. 6, 2012, pp. 319-329. doi: 10.4236/iim.2012.46036.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.