Abstract
Product disassembly takes place in remanufacturing, recycling, and disposal. The disassembly line is the best choice for automated disassembly, so it is essential that it be designed and balanced to work efficiently. The multi-objective disassembly line balancing problem seeks to find a disassembly sequence which provides a feasible disassembly sequence, minimizes the number of workstations, minimizes idle time, balances the line (ensures similar idle times at each workstation), as well as addressing other disassembly-specific concerns. However, finding the optimal balance is computationally intensive due to exponential growth, with exhaustive search quickly becoming prohibitively large. In this paper, an ant colony optimization metaheuristic is presented for obtaining optimal or near-optimal solutions to the disassembly line balancing problem. Examples are considered to illustrate implementation of the methodology. Conclusions drawn include the consistent generation of near-optimal solutions, the ability to preserve precedence, the superior speed of the metaheuristic, and its practicality due to its ease of implementation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
