T.-C. Chiang, H.-C. Cheng and L.-C. Fu, “NNMA: An Effective Memetic Algorithm for Solving Multiobjective Permutation Flow Shop Scheduling Problems,” Expert Systems with Applications, Vol. 38, No. 5, 2011, pp. 5986-5999. doi:10.1016/j.eswa.2010.11.022

has been cited by the following article:

• TITLE: Modified NSGA-II for a Bi-Objective Job Sequencing Problem

  AUTHORS: Susmita Bandyopadhyay

  KEYWORDS: Job Sequencing; Multi-Objective Evolutionary Algorithm (MOEA); NSGA-II (Non-Dominated Sorting Genetic Algorithm-II); Tardiness; Deterioration Cost

  JOURNAL NAME: Intelligent Information Management, Vol.4 No.6, November 20, 2012

  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.