Determining optimum and suboptimum disassembly sequences with an application to a cell phone

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