Abstract
Disassembly activities take place in various recovery operations including remanufacturing, recycling, and disposal. The disassembly line is the best choice for automated disassembly of returned products, a feature that will be become crucial in the future. It is, therefore, important that the disassembly line be designed and balanced so that it works as efficiently as possible. However, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large, even for relatively small products. In this paper, we solve the disassemb ly line balancing problem using combinatorial optimization techniques, which are instrumental in obtaining near-optimal solutions to problems with intractably large solution spaces. Specifically, a genetic algorithm is presented for obtaining optimal or near-optimal solutions for disassembly line balancing problems. An example is presented to illustrate the implementation of the methodology.
Keywords
Disassembly line balancing, End of life products, Disassembly
Subject Categories
Production engineering
Disciplines
Engineering
Publisher
Omnipress
Publication Date
2003
Rights Information
Copyright 2003, Surendra M. Gupta
Rights Holder
Gupta M. Surendra
Permanent URL
Recommended Citation
Gupta, Surendra M.; McGovern, Seamus M.; and Kamarthi, Sagar V., "Solving disassembly sequence planning problems using combinatorial optimization" (2003). . Paper 106. http://hdl.handle.net/2047/d10013842
Click button above to open, or right-click to save.
Notes
Originally published in the Proceedings of the 2003 Northeast Decision Sciences Institute Conference, Providence, Rhode Island, pp. 178-180, March 27-29, 2003