A branch, bound, and remember algorithm for the simple disassembly line balancing problem

DOI10.1016/j.cor.2019.01.003zbMath1458.90235OpenAlexW2911039373WikidataQ128606897 ScholiaQ128606897MaRDI QIDQ1722962

Jinlin Li, Zhanguo Zhu, Caijun Yang, Chengbin Chu, Xiao Hong Chen

Publication date: 19 February 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.01.003

zbMATH Keywords

branch and boundlower boundheuristicdisassembly line balancing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (9)

An exact solution method for multi-manned disassembly line design with and/or precedence relations ⋮ A dynamic programming approach to a multi-objective disassembly line balancing problem ⋮ A novel constraint programming and simulated annealing for disassembly line balancing problem with and/or precedence and sequence dependent setup times ⋮ An integrated approach for a new flexible multi-product disassembly line balancing problem ⋮ Models and two-phase bee algorithms for multi-objective U-shaped disassembly line balancing problem ⋮ Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs ⋮ Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach ⋮ Type-E disassembly line balancing problem with multi-manned workstations ⋮ Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches

Cites Work

• Unnamed Item
• Second order conic approximation for disassembly line design with joint probabilistic constraints
• A disassembly line balancing problem with fixed number of workstations
• A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
• A sample average approximation method for disassembly line balancing problem under uncertainty
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• Generation of assembly graphs by systematic analysis of assembly structures
• A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
• Disassembly line in product recovery
• New classes of fast lower bounds for bin packing problems

This page was built for publication: A branch, bound, and remember algorithm for the simple disassembly line balancing problem