Abstract

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.

Notes

Originally published in the Proceedings of the SPIE International Conference on Environmentally Conscious Manufacturing VI, Boston, Massachusetts, pp. 57-67, October 1-3, 2006

Keywords

disassembly, integer linear programming (ILP), binary integer linear programming (BILP), precedence

Subject Categories

Production engineering

Disciplines

Engineering

Publisher

SPIE

Publication Date

2006

Rights Information

Copyright 2006, Society of Photo-Optical Instrumentation Engineers

Restrictions

This paper was published in Proceedings of SPIE (Volume 6385) and is made available as an electronic reprint with permission of SPIE. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.

Rights Holder

Gupta M. Surendra


View Full Text

Click button above to open, or right-click to save.

Included in

Engineering Commons

Share

COinS