Abstract
We study the disassembly process of a moderately complex consumer product (cell phone) consisting of 25 components. The investigation involves a heuristically solved disassembly line balancing problem and the determination of an appropriate disassembly sequence influenced by sequence-dependent costs, which is based on a novel combination of exact and heuristic algorithms. The issue of generating various suboptimum solutions to cope with multiple optimization criteria is also discussed.
Keywords
Disassembly Line Balancing Problem (DLBP), Disassembly
Disciplines
Industrial Engineering | Mechanical Engineering
Publisher
IEEE
Publication Date
2005
Rights Information
(c) 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Rights Holder
IEEE
Permanent URL
Recommended Citation
Lambert, A.J.D. (Fred) and Gupta, Surendra M., "Determining optimum and suboptimum disassembly sequences with an application to a cell phone" (2005). Mechanical and Industrial Engineering Faculty Publications. Paper 29. http://hdl.handle.net/2047/d20000311
Click button above to open, or right-click to save.
COinS
Notes
Originally published in the Proceedings of the 6th IEEE International Symposium on Assembly and Task Planning (ISATP2005), Montreal, Canada, July 19-21, 2005 (CD-ROM)