IJSRP, Volume 4, Issue 2, February 2014 Edition [ISSN 2250-3153]
Vincent Lal , C. Anand Deva Durai
The purpose of this paper is to show the survey study done on the optimization algorithms for the Flexible Job Shop Scheduling Problem. There are many algorithms that have been used for finding the optimal solution of Flexible Job Shop Scheduling Problem. Here the Multi Objective aspects have been also taken into consideration. The FJS problem has already been proved an NP hard problem. Pareto optimality principal enriches the solution with the ease of finding the optimal solution.