TY - JOUR
T1 - A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem
AU - Pérez, Miguel A.Fernández
AU - Raupp, Fernanda M.P.
N1 - Publisher Copyright:
© 2014, Springer Science+Business Media New York.
PY - 2016/4/1
Y1 - 2016/4/1
N2 - 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.
AB - 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.
KW - Flexible job-shop scheduling
KW - Heuristic algorithm
KW - Multi-criteria Newton method
KW - Multi-objective optimization
UR - http://www.scopus.com/inward/record.url?scp=84961157635&partnerID=8YFLogxK
U2 - 10.1007/s10845-014-0872-0
DO - 10.1007/s10845-014-0872-0
M3 - Article
AN - SCOPUS:84961157635
SN - 0956-5515
VL - 27
SP - 409
EP - 416
JO - Journal of Intelligent Manufacturing
JF - Journal of Intelligent Manufacturing
IS - 2
ER -