Disassembly leveling and lot-sizing for multiple product types with uncertain component demands
- Authors
- Choi, Yun-Hyok; Kim, Hyeon-Il; Lee, Dong-Ho
- Issue Date
- Sep-2023
- Publisher
- SAGE PUBLICATIONS LTD
- Keywords
- Manufacturing management; disassembly leveling and lot-sizing; uncertain demands; parts commonality; sample average approximation
- Citation
- PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, v.237, no.11, pp.1660 - 1670
- Indexed
- SCIE
SCOPUS
- Journal Title
- PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE
- Volume
- 237
- Number
- 11
- Start Page
- 1660
- End Page
- 1670
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191098
- DOI
- 10.1177/09544054221136526
- ISSN
- 0954-4054
- Abstract
- Disassembly leveling and lot-sizing is an integrated problem of determining the depth of disassembling a product and the resulting amounts of disassembling the product and its subassemblies to satisfy component demands. This study addresses two stochastic versions of the problem for multiple product types with uncertain component demands: a basic problem and its extension with parts commonality. The objective is to minimize the sum of expected setup and operation costs. For the basic problem without parts commonality, an optimal sample average approximation algorithm is proposed and then illustrated with a numerical example after formulating it as a stochastic integer programing model. Also, due to the complexity of the extended problem, sample average approximation based heuristics are proposed and computational results are reported. In particular, the results show that the best heuristic gives near optimal solutions for small sized test instances.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 산업공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/191098)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.