Solving Flexible Job Shop Scheduling with Multi Objective Approach

Arash Motaghedi-larijani, Kamyar Sabri-laghaie, Mahdi Heydari
2010 International Journal of Industrial Engineering and Production Research  
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optimal solutions in a reasonable run time. The algorithm utilizes from a local search heuristic for improving
more » ... the chance of obtaining more number of global Pareto-optimal solutions. The solution method uses from a perturbed global criterion function for guiding the search direction of the hybrid algorithm. Computational experiences show that the hybrid algorithm has superior performance in contrast to previous studies .
doaj:65513e0b10a44d14aa8ba11c45d25b78 fatcat:5ohtrwcfnnenrdxqo3x7aqegd4