An integrated model and its extension for disassembly leveling and lot-sizing for multiple product types
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kang, Kyung-Wan | - |
dc.contributor.author | Doh, Hyoung-Ho | - |
dc.contributor.author | Park, Jung-Hyeon | - |
dc.contributor.author | Lee, Dong-Ho | - |
dc.date.accessioned | 2022-07-16T17:45:48Z | - |
dc.date.available | 2022-07-16T17:45:48Z | - |
dc.date.created | 2021-05-13 | - |
dc.date.issued | 2011-12 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/166903 | - |
dc.description.abstract | Disassembly leveling, one of disassembly process planning decisions, is to determine disassembly structures that specify parts/subassemblies to be obtained from used/end-of-life products, and disassembly lot-sizing is the problem of determining the amounts of disassembly operations required to satisfy the demands of their parts and/or subassemblies. In this study, we consider the two problems at the same time for the objective of minimizing the sum of disassembly setup and operation costs. In particular, we consider a generalized version in which disassembly levels may be different even for products of the same type. Two types of the problem are considered: (a) basic problem without parts commonality, i.e., products do not share their parts/subassemblies; and (b) extended problem with parts commonality. For the basic problem, a polynomial-time optimal algorithm is suggested after developing a mathematical programming model. Also, we show that the extended problem is NP-hard and then suggest a heuristic, together with its computational results. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE | - |
dc.title | An integrated model and its extension for disassembly leveling and lot-sizing for multiple product types | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1109/SII.2011.6147543 | - |
dc.identifier.scopusid | 2-s2.0-84863174877 | - |
dc.identifier.bibliographicCitation | 2011 IEEE/SICE International Symposium on System Integration, SII 2011, pp.756 - 761 | - |
dc.relation.isPartOf | 2011 IEEE/SICE International Symposium on System Integration, SII 2011 | - |
dc.citation.title | 2011 IEEE/SICE International Symposium on System Integration, SII 2011 | - |
dc.citation.startPage | 756 | - |
dc.citation.endPage | 761 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Computational results | - |
dc.subject.keywordPlus | Disassembly operations | - |
dc.subject.keywordPlus | Disassembly process planning | - |
dc.subject.keywordPlus | Integrated models | - |
dc.subject.keywordPlus | Lot sizing | - |
dc.subject.keywordPlus | Mathematical programming models | - |
dc.subject.keywordPlus | Multiple products | - |
dc.subject.keywordPlus | NP-hard | - |
dc.subject.keywordPlus | Operation cost | - |
dc.subject.keywordPlus | Optimal algorithm | - |
dc.subject.keywordPlus | Polynomial-time | - |
dc.subject.keywordPlus | Computer programming | - |
dc.subject.keywordPlus | Mathematical programming | - |
dc.subject.keywordPlus | Integration | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/6147543 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.