Multi-Objective Flexible Job Shop Scheduling Optimization by Means of Promethee I Method

This paper presents an algorithm to solve multi-objective Flexible Job Shop Scheduling problems (FJSSP) combining a heuristic algorithm with Promethee I solutions ranking. The formulated FJSSP includes four objectives (criteria). The criteria values are compared pair-wise to arrange the obtained non-dominated solutions. The proposed methodology allows better evaluation of solutions quality and reduces very much the efforts of Decision Maker (DM) in the choice of preferred final compromise solution.