An optimal algorithm for disassembly scheduling with assembly product structure

Authors:
Hwa-Joong Kim;Dong-Ho Lee;Paul Xirouchakis
Affiliations:
Institute of Production and Robotics (STI-IPR-LICP), Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland;Department of Industrial Engineering, Hanyang University, Seoul, Korea;Institute of Production and Robotics (STI-IPR-LICP), Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
Venue:
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Year:
2005

Citing 3
Cited 0

Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case

Operations Research - Supplement
Disassembly of multiple product structures

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Disassembly Scheduling with Parts Commonality Using Petri Nets with Timestamps

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.