Wan-Lin Yang

A Branch-Bound-and-Remember Search Framework for U-Shaped Disassembly Line Balancing Problems

The U-shaped Disassembly Line Balancing Problem (UDLBP) is a challenging combinatorial optimization problem for which efficient solution approaches remain limited. This study proposes an efficient branch-bound-and-remember (BBR) algorithm that integrates a memory-based mechanism and U-shaped dominance rules to effectiv...