Login / Signup
A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem.
Eduardo Álvarez-Miranda
Jordi Pereira
Mariona Vilà
Published in:
Comput. Oper. Res. (2024)
Keyphrases
</>
branch bound
computational complexity
linear programming
cost function
worst case
genetic algorithm
objective function
particle swarm optimization
bin packing
optimal solution
np hard
dynamic programming
probabilistic model
production system
assembly line balancing