Capacitated disassembly scheduling: Minimizing the number of products disassembled

Jun Gyu Kim, Hyong Bae Jeon, Hwa Joong Kim, Dong Ho Lee, Paul Xirouchakis

Research output: Contribution to journalConference articlepeer-review

6 Scopus citations

Abstract

Disassembly scheduling is the problem of determining the timing and quantity of disassembling used products to satisfy the demands of their parts or components over the planning horizon. This paper focuses on the case of single product type without parts commonality while the resource capacity restrictions are explicitly considered. The problem is formulated as an integer program for the objective of minimizing the number of products to be disassembled, and an optimal algorithm, after deriving the properties of the problem, is suggested. Computational experiments are done on randomly generated test problems, and the results are reported.

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

Fingerprint Dive into the research topics of 'Capacitated disassembly scheduling: Minimizing the number of products disassembled'. Together they form a unique fingerprint.

Cite this