A lagrangean relaxation approach for capacitated disassembly scheduling

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:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
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

We consider the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. This paper focuses on the capacitated version of the problem for the objective of minimizing the sum of setup, disassembly operation, and inventory holding costs. The problem is formulated as an integer program, and to solve the problem, a Lagrangean heuristic algorithm is developed after reformulating the integer program. To show the performance of the heuristic algorithm, computational experiments are done on randomly generated test problems, and the test results show that the algorithm suggested in this paper works well.