A Bi-Objective Stage Shop Scheduling Problem with Modified NSGA-II and Modified MOPSO

Abstract

Stage shop scheduling is an emergent area in the field of scheduling. This paper has proposed a bi-objective stage shop scheduling problem with total completion time and total tardiness of jobs, as objectives. In order to solve the proposed formulated problem, modified NSGA-II (Nondominated Sorting Genetic Algorithm – II) and modified MOPSO (Multi-Objective Particle Swarm Optimization) have been proposed. A mutation algorithm for NSGA-II and a velocity updation algorithm based on circular motion of alleles (for NSGA-II) and circular motion of particles (for MOPSO) have also been introduced and have been embedded in the proposed algorithms. The experimental results show that NSGA-II performs better than MOPSO in some aspects, whereas MOPSO performs better than NSGA-II in some other aspects.