Simultaneous reassembly and procurement planning in assemble-to-order remanufacturing systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oh, Yosep | - |
dc.contributor.author | Behdad, Sara | - |
dc.date.accessioned | 2023-11-14T01:30:02Z | - |
dc.date.available | 2023-11-14T01:30:02Z | - |
dc.date.issued | 2017-02 | - |
dc.identifier.issn | 0925-5273 | - |
dc.identifier.issn | 1873-7579 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/115393 | - |
dc.description.abstract | Assemble-to-Order (ATO) remanufacturing systems deal with decision-making on the number and type of modules ready for reassembly, while managing a high degree of uncertainty in the quantity of incoming end-of-life products. Remanufacturers who adopt the waste stream system often passively accept an unpredictable amount of collected supply in their systems. Also, they often keep various items in their inventory for future reassembly purposes despite the parts depreciation which leverages part values in the second-hand market. To overcome these challenges, this paper proposes a graph-based optimization model for simultaneous reassembly and procurement planning with the aim of determining the type and number of parts that should be reassembled and procured, considering the market demand for both cores and subassemblies. This study articulates the problem employing a network flow graph and integer linear programming (ILP). In addition, the study suggests two key concepts: (1) disposal point, and (2) reassembly threshold. Considering recycling benefits and holding costs, the disposal point helps remanufacturers make proper decisions on the time that they have to dispose of parts that are stored in their inventory. The reassembly threshold makes remanufacturers recognize a tipping point for reassembly process cost where they have to keep parts rather than reassemble them. The application of the proposed method is illustrated using a smartphone example. © 2016 Elsevier B.V. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | Simultaneous reassembly and procurement planning in assemble-to-order remanufacturing systems | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.ijpe.2016.12.009 | - |
dc.identifier.scopusid | 2-s2.0-85004000451 | - |
dc.identifier.wosid | 000392044300015 | - |
dc.identifier.bibliographicCitation | International Journal of Production Economics, v.184, pp 168 - 178 | - |
dc.citation.title | International Journal of Production Economics | - |
dc.citation.volume | 184 | - |
dc.citation.startPage | 168 | - |
dc.citation.endPage | 178 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | PRODUCT FAMILY DESIGNPRODUCTION DECISIONSINVENTORY CONTROLDEMANDDISPOSALPOLICIESQUALITYFUTURE | - |
dc.subject.keywordAuthor | Assemble-to-Order (ATO) systems | - |
dc.subject.keywordAuthor | Integer linear programming (ILP) | - |
dc.subject.keywordAuthor | Network flow graph | - |
dc.subject.keywordAuthor | Part depreciation | - |
dc.subject.keywordAuthor | Reassembly and procurement planning | - |
dc.subject.keywordAuthor | Remanufacturing | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0925527316303863?pes=vor | - |
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.