A branch, bound, and remember algorithm for the simple disassembly line balancing problem
DOI10.1016/J.COR.2019.01.003zbMATH Open1458.90235OpenAlexW2911039373WikidataQ128606897 ScholiaQ128606897MaRDI QIDQ1722962FDOQ1722962
Authors: Jinlin Li, Zhanguo Zhu, Caijun Yang, Chengbin Chu, Xiaohong 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
Recommendations
- A dynamic programming approach to a multi-objective disassembly line balancing problem
- An adaptive genetic algorithm-based and AND/OR graph approach for the disassembly line balancing problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- A disassembly line balancing problem with fixed number of workstations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Cites Work
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- Scheduling algorithms
- New classes of fast lower bounds for bin packing problems
- Second order conic approximation for disassembly line design with joint probabilistic constraints
- A sample average approximation method for disassembly line balancing problem under uncertainty
- Disassembly line in product recovery
- A disassembly line balancing problem with fixed number of workstations
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Generation of assembly graphs by systematic analysis of assembly structures
Cited In (13)
- An exact solution method for multi-manned disassembly line design with and/or precedence relations
- Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach
- Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches
- A dynamic programming approach to a multi-objective disassembly line balancing problem
- An adaptive genetic algorithm-based and AND/OR graph approach for the disassembly line balancing problem
- A sample average approximation method for disassembly line balancing problem under uncertainty
- Profit-oriented disassembly-line balancing
- 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
- Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs
- A disassembly line balancing problem with fixed number of workstations
- Type-E disassembly line balancing problem with multi-manned workstations
- Models and two-phase bee algorithms for multi-objective U-shaped disassembly line balancing problem
This page was built for publication: A branch, bound, and remember algorithm for the simple disassembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1722962)
