A fast branch, bound and remember algorithm for disassembly line balancing problem.
Zixiang LiZeynel Abidin ÇilSüleyman MeteIbrahim KucukkocPublished in: Int. J. Prod. Res. (2020)
Keyphrases
- branch bound
- objective function
- search space
- probabilistic model
- simulated annealing
- optimization algorithm
- dynamic programming
- k means
- np hard
- special case
- worst case
- exhaustive search
- optimal solution
- linear programming
- computational efficiency
- solution quality
- particle swarm optimization algorithm
- depth first search
- neural network