Solving Bi-objective FJSP Using Limited Stable Matching Strategy

Abstract

In practical productions,scheduling with bi-objective including minimum target completion time and minimum production costs was the most common problems in flexible production workshops.An optimization method with limited stable matching strategy was introduced herein to solve FJSP with the bi-objective.The method decomposed a bi-objective optimization problem into a set of scalar optimization subproblems and optimized them using multi-objective evolutionary algorithm.Meanwhile,the limited stable matching strategy was used for coordinating the solutions of subproblems in the evolution processes to ensure the convergence and diversity of the solutions.The simulation data and application examples demonstrat that the proposed method may obtain the scheduling scheme with the better convergence and diversity to meet the different preferences of decision makers.