Share Email Print

Proceedings Paper

2-opt heuristic for the disassembly line balancing problem
Format Member Price Non-Member Price
PDF $14.40 $18.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 activities are an important part of product recovery operations. The disassembly line is the best choice for automated disassembly of returned products. However, finding the optimal balance for a disassembly line is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line-balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while addressing hazardous and high demand components. A two optimal algorithm is then developed to balance the part removal sequence and attempt to further reduce the total number of workstations. Examples are considered to illustrate the methodology. The conclusions drawn from the study include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the algorithms and their practicality due to the ease of implementation.

Paper Details

Date Published: 27 February 2004
PDF: 14 pages
Proc. SPIE 5262, Environmentally Conscious Manufacturing III, (27 February 2004); doi: 10.1117/12.516155
Show Author Affiliations
Seamus M. McGovern, Northeastern Univ. (United States)
Surendra M. Gupta, Northeastern Univ. (United States)

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

© SPIE. Terms of Use
Back to Top