Translator Disclaimer
8 December 2004 Combinatorial optimization methods for disassembly line balancing
Author Affiliations +
Proceedings Volume 5583, Environmentally Conscious Manufacturing IV; (2004)
Event: Optics East, 2004, Philadelphia, Pennsylvania, United States
Disassembly takes place in remanufacturing, recycling, and disposal with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: minimizes workstations, ensures similar idle times, and is feasible. Finding the optimal balance is computationally intensive due to factorial growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven to belong to the class of NP-complete problems. Ant colony optimization, genetic algorithm, and H-K metaheuristics are presented and compared along with a greedy/hill-climbing heuristic hybrid. A numerical study is performed to illustrate the implementation and compare performance. Conclusions drawn include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the techniques, and their practicality due to ease of implementation.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Seamus M. McGovern and Surendra M. Gupta "Combinatorial optimization methods for disassembly line balancing", Proc. SPIE 5583, Environmentally Conscious Manufacturing IV, (8 December 2004);

Back to Top