Academic Journals Database
Disseminating quality controlled scientific knowledge

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

Author(s): Susmita Bandyopadhyay

Journal: Intelligent Information Management
ISSN 2160-5912

Volume: 04;
Issue: 06;
Start page: 319;
Date: 2012;
Original page

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

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.
Affiliate Program      Why do you need a reservation system?