en و موضوعات مربوط Other Related Subject پژوهشي Research <p> <i> 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 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 . </i></p> Flexible jobshop scheduling, Multi criteria decision making, global programming, Genetic algorithm, Hill climbing 197 209 http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-47-2&slc_lang=en&sid=1 Arash Motaghedi-larijani a.motaghedi.ie@gmail.com 18003194753284600831 18003194753284600831 No A. Motaghedi-larijani, Author is with the Department of Industrial Engineering, Iran University of science & technology , Narmak, Tehran, Iran Kamyar Sabri-laghaie K_sabri@ind.iust.ac.ir 18003194753284600832 18003194753284600832 No Author with the same Department Tehran, Iran Mahdi Heydari Mheydari@iust.ac.ir 18003194753284600833 18003194753284600833 Yes Author is a Faculty at the same Department, Tehran, Iran