Disassembly leveling and lot sizing for multiple product types: a basic model and its extension
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 | 2021-06-22T17:22:46Z | - |
dc.date.available | 2021-06-22T17:22:46Z | - |
dc.date.created | 2021-01-21 | - |
dc.date.issued | 2016-02 | - |
dc.identifier.issn | 0268-3768 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/14563 | - |
dc.description.abstract | We consider two interrelated problems that occurred in disassembly systems: disassembly leveling and lot sizing. Disassembly leveling, one of disassembly process planning decisions, is to determine disassembly structures that specify parts and/or subassemblies to be obtained from disassembling 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. Unlike the existing studies, this study considers 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 in this study. The first one is the basic problem without parts commonality, i.e., products do not share their parts or subassemblies, for which a polynomial time optimal algorithm is suggested after developing a mathematical programming model. The second one is an extended problem with parts commonality. After developing another mathematical programming model for the extension, we prove that it is NP hard. Then, a heuristic algorithm is suggested together with its computational results. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER LONDON LTD | - |
dc.title | Disassembly leveling and lot sizing for multiple product types: a basic model and its extension | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Dong-Ho | - |
dc.identifier.doi | 10.1007/s00170-012-4570-9 | - |
dc.identifier.scopusid | 2-s2.0-84956617454 | - |
dc.identifier.wosid | 000368996900001 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, v.82, no.9-12, pp.1463 - 1473 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | - |
dc.citation.title | INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | - |
dc.citation.volume | 82 | - |
dc.citation.number | 9-12 | - |
dc.citation.startPage | 1463 | - |
dc.citation.endPage | 1473 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Automation & Control Systems | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.subject.keywordPlus | RECOVERY | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | METHODOLOGY | - |
dc.subject.keywordPlus | PARTS | - |
dc.subject.keywordAuthor | Disassembly leveling | - |
dc.subject.keywordAuthor | Disassembly lot-sizing | - |
dc.subject.keywordAuthor | Parts commonality | - |
dc.subject.keywordAuthor | Optimal and heuristic algorithms | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s00170-012-4570-9 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
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.