A Lagrangean relaxation approach for capacitated disassembly scheduling

Hwa Joong Kim, Dong Ho Lee, Paul Xirouchakis

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

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.

Original languageEnglish
Pages (from-to)722-732
Number of pages11
JournalLecture Notes in Computer Science
Volume3483
Issue numberIV
DOIs
StatePublished - 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

Fingerprint Dive into the research topics of 'A Lagrangean relaxation approach for capacitated disassembly scheduling'. Together they form a unique fingerprint.

Cite this