MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEM

For achieving the optimal solution, scheduling is the necessary phenomenon and among all the presently available techniques of scheduling, FJSP is one of the most progressing technique. It overcomes the limitations of JSP in which machines and jobs are flexible to perform their action. Multi-objective FJSP is much complicated than single objective FJSP; many techniques are introduced to improve its performance. In this paper, PSO is used with mutation method to achieve the optimized solution for multi-objective FJSP in hard real time. The hybrid algorithm of PSO with mutation method shows the better performance in comparison of NSGA-II, Pareto front shows its performance along with this several performance measures i. e. MID, SNS, RAS, and DM have used to measure the performance.