A branch-and-bound method for the bi-objective simple line assembly balancing problem.

Audrey Cerqueus Xavier Delorme

Published in: Int. J. Prod. Res. (2019)

Keyphrases

bi objective
branch and bound method
multi objective
branch and bound
efficient solutions
special case
neural network
lower bound
multi objective optimization
bayesian networks
optimal solution
evolutionary algorithm
optimization problems
ant colony optimization
shortest path problem
mixed integer programming