Login / Signup
An efficient branch and bound algorithm for smoothing the workloads on simple assembly lines.
Öncü Hazir
Maher A. N. Agi
Jérémy Guérin
Published in:
Int. J. Prod. Res. (2021)
Keyphrases
</>
branch and bound algorithm
precedence constraints
assembly line
branch and bound
lower bound
upper bound
optimal solution
lower bounding
upper bounding
search tree
np hard
assembly line balancing
combinatorial optimization
neural network
multistage
randomly generated problems
finding an optimal solution