An Optimal Algorithm for Disassembly Scheduling with Assembly Product Structure.
Department of Industrial Engineering , Hanyang University, Sŏul, Seoul, South Korea
DOI: 10.1007/11551263_20 Conference: KI 2005: Advances in Artificial Intelligence, 28th Annual German Conference on AI, KI 2005, Koblenz, Germany, September 11-14, 2005, Proceedings
This paper considers the problem of determining the quantity and timing of disassembling used or end-of-life products in order
to satisfy the demand of their parts or components over a finite planning horizon. We focus on the case of single product
type without parts commonality, i.e., assembly product structure. The objective is to minimize the sum of setup, disassembly
operation, and inventory holding costs. Several properties of optimal solutions are derived, and then a branch and bound algorithm
is developed based on the Lagrangian relaxation technique. Results of computational experiments on randomly generated test
problems show that the algorithm finds the optimal solutions in a reasonable amount of computation time.
Available from: ocean.kisti.re.kr
[Show abstract] [Hide abstract]
ABSTRACT: Disassembly scheduling is the problem of determining the quantity and timing of disassembling used or end-of-life products while satisfying the demand of their parts and/or components over a planning horizon. The case of assembly product structure is considered while the resource capacity constraints are explicitly considered. A cost-based objective is considered that minimizes the sum of disassembly operation and inventory holding costs. The problem is formulated as an integer programming model, and a two-stage heuristic with construction and improvement algorithms is suggested in this paper. To test the performance of the heuristic, computational experiments are done on randomly generated problems, and the results show that the heuristic gives near optimal solutions within a very short amount of computation time.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.