An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset.
David R. MorrisonEdward C. SewellSheldon H. JacobsonPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- branch bound
- cost function
- bin packing
- energy function
- computational complexity
- expectation maximization
- assembly line balancing
- memetic algorithm
- objective function
- np hard
- optimal solution
- linear programming
- optimization problems
- graph cuts
- worst case
- global optimization
- exhaustive search
- space complexity
- dynamic programming
- search space