Optimum disassembly sequencing

Title:
Optimum disassembly sequencing
Creator:
Gupta, Surendra M. (Author)
Lambert, A. J. D. (Author)
Language:
English
Publisher:
SPIE
Copyright date:
2006
Type of resource:
Text
Genre:
Articles
Format:
electronic
Digital origin:
born digital
Abstract/Description:

We consider the disassembly sequencing problem subjected to sequence dependent disassembly costs. Because most of the available methods that deal with such problems rely on metaheuristic and heuristic methods, it is desirable to have exact methods available that can at least be applied to medium sized problems to determine if the heuristically obtained solutions are acceptable or not. The conventional integer linear programming (ILP) approaches become unmanageable even for modest product complexity cases. In this paper, we propose an iterative method that repeatedly solves a binary integer linear programming (BILP) problem. The method converges quickly for medium sized problems. We use the proposed method to solve a cell phone problem from practice, consisting of 25 components that are represented, according to a set of precedence relationships, via a disassembly precedence graph.

Comments:
Originally published in the Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing VI, Boston, Massachusetts, pp. 57-67, October 1-3, 2006
Subjects and keywords:
Production engineering
disassembly
integer linear programming (ILP)
binary integer linear programming (BILP)
precedence
Engineering
Permanent URL:
http://hdl.handle.net/2047/d10010075

Downloads