Share Email Print

Proceedings Paper

Uninformed and probabilistic distributed agent combinatorial searches for the unary NP-complete disassembly line balancing problem
Format Member Price Non-Member Price
PDF $17.00 $21.00

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: is feasible, minimizes workstations, and ensures similar idle times, as well as other end-of-life specific concerns. Finding the optimal balance is computationally intensive due to exponential growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven here to belong to the class of unary NP-complete problems. Probabilistic (ant colony optimization) and uninformed (H-K) search methods are presented and compared. Numerical results are obtained using a recent case study to illustrate the search implementations and compare their performance. Conclusions drawn include the consistent generation of 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: 4 November 2005
PDF: 12 pages
Proc. SPIE 5997, Environmentally Conscious Manufacturing V, 59970B (4 November 2005); doi: 10.1117/12.629121
Show Author Affiliations
Seamus M. McGovern, Northeastern Univ. (United States)
Surendra M. Gupta, Northeastern Univ. (United States)

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

© SPIE. Terms of Use
Back to Top