Solving disassembly sequence planning problems using combinatorial optimization

Title:
Solving disassembly sequence planning problems using combinatorial optimization
Creator:
Gupta, Surendra M. (Author)
McGovern, Seamus M. (Author)
Kamarthi, Sagar V. (Author)
Language:
English
Publisher:
Omnipress
Copyright date:
2003
Type of resource:
Text
Genre:
Articles
Format:
electronic
Digital origin:
born digital
Abstract/Description:

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.

Comments:

Originally published in the Proceedings of the 2003 Northeast Decision Sciences Institute Conference, Providence, Rhode Island, pp. 178-180, March 27-29, 2003

Subjects and keywords:
Production engineering
Disassembly line balancing
End of life products
Disassembly
Engineering
Permanent URL:
http://hdl.handle.net/2047/d10013842

Downloads