Share Email Print

Proceedings Paper

Combinatorial optimization methods for disassembly line balancing
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

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.

Paper Details

Date Published: 8 December 2004
PDF: 14 pages
Proc. SPIE 5583, Environmentally Conscious Manufacturing IV, (8 December 2004); doi: 10.1117/12.570493
Show Author Affiliations
Seamus M. McGovern, Northeastern Univ. (United States)
Surendra M. Gupta, Northeastern Univ. (United States)

Published in SPIE Proceedings Vol. 5583:
Environmentally Conscious Manufacturing IV
Surendra M. Gupta, Editor(s)

© SPIE. Terms of Use
Back to Top