Share Email Print

Proceedings Paper

A heuristic solution for the disassembly line balancing problem incorporating sequence dependent costs
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper deals with disassembly sequencing problems subjected to sequence dependent disassembly costs. We present a heuristic and an iterative method based on partial branch and bound concept to solve such problems. Since heuristic methods intrinsically generate suboptimum solutions, we compared the heuristically obtained solutions with the exact solutions to see if they are reasonably good or not. This process, however, is limited to small or perhaps medium sized problems only as the required CPU time for exact methods tends to increase exponentially with the problem size. For the problems tested, we observed that the methods described in this paper generate surprisingly good results using almost negligible amount of CPU time.

Paper Details

Date Published: 4 November 2005
PDF: 8 pages
Proc. SPIE 5997, Environmentally Conscious Manufacturing V, 59970A (4 November 2005); doi: 10.1117/12.637368
Show Author Affiliations
A. J. D. Lambert, Technische Univ. Eindhoven (Netherlands)
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