Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm

José Carlos Soto Monterrubio
José Carlos Soto Monterrubio
Héctor J. Fraire H.
Héctor J. Fraire H.
Claudia Gómez Santillán
Claudia Gómez Santillán

Swarm Evol. Comput., pp. 1006322020.

Cited by: 0|Bibtex|Views18|Links
EI

Abstract:

Abstract This work presents a novel parallel branch and bound algorithm to efficiently solve to optimality a set of instances of the multi-objective flexible job shop scheduling problem for the first time, to the very best of our knowledge. It makes use of the well-known NSGA-II algorithm to initialize its upper bound. The algorithm is ...More

Code:

Data:

Your rating :
0

 

Tags
Comments