This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.
Original paper

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

Volume: 58, Issue: 11, Pages: 3220 - 3234
Published: Jun 20, 2019
Abstract
In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution...
Paper Details
Title
A fast branch, bound and remember algorithm for disassembly line balancing problem
Published Date
Jun 20, 2019
Volume
58
Issue
11
Pages
3220 - 3234
© 2025 Pluto Labs All rights reserved.
Step 1. Scroll down for details & analytics related to the paper.
Discover a range of citation analytics, paper references, a list of cited papers, and more.