A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem

We propose a new hierarchical heuristic algorithm for multi-objective flexible job-shop scheduling problems. The proposed method is an adaptation of the Newton’s method for continuous multi-objective unconstrained optimization problems, belonging to the class of multi-criteria descent methods. Numerical experiments with the proposed method are presented. The potential of the proposed method is demonstrated by comparing the obtained results with the known results of existing methods that solve the same test instances.