%0 Journal Article
	%A Seyed Habib A. Rahmati
	%D 2012
	%J International Journal of Industrial and Manufacturing Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 61, 2012
	%T Proposing a Pareto-based Multi-Objective Evolutionary Algorithm to Flexible Job Shop Scheduling Problem
	%U https://publications.waset.org/pdf/13872
	%V 61
	%X During last decades, developing multi-objective
evolutionary algorithms for optimization problems has found
considerable attention. Flexible job shop scheduling problem, as an
important scheduling optimization problem, has found this attention
too. However, most of the multi-objective algorithms that are
developed for this problem use nonprofessional approaches. In
another words, most of them combine their objectives and then solve
multi-objective problem through single objective approaches. Of
course, except some scarce researches that uses Pareto-based
algorithms. Therefore, in this paper, a new Pareto-based algorithm
called controlled elitism non-dominated sorting genetic algorithm
(CENSGA) is proposed for the multi-objective FJSP (MOFJSP). Our
considered objectives are makespan, critical machine work load, and
total work load of machines. The proposed algorithm is also
compared with one the best Pareto-based algorithms of the literature
on some multi-objective criteria, statistically.
	%P 316 - 321