Disassembly scheduling with capacity constraints: minimizing the number of products disassembled
- Authors
- Kim, Jun-Gyu; Jeon, Hyong-Bae; Kim, Hwa-Joong; Lee, Dong-Ho; Xirouchakis, Paul
- Issue Date
- Sep-2006
- Publisher
- SAGE PUBLICATIONS LTD
- Keywords
- planning and scheduling; disassembly systems; environment
- Citation
- PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, v.220, no.9, pp.1473 - 1481
- Indexed
- SCIE
SCOPUS
- Journal Title
- PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE
- Volume
- 220
- Number
- 9
- Start Page
- 1473
- End Page
- 1481
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/181079
- DOI
- 10.1243/09544054JEM349
- ISSN
- 0954-4054
- Abstract
- Disassembly scheduling, one of the important operational problems in disassembly systems, is the problem of determining the timing and quantity of disassembling used or end-of-life products to satisfy the demand of their parts or components over a given planning horizon. This paper focuses on the case of single product type without parts commonality while the resource capacity restrictions are considered explicitly. The problem is formulated as an integer programming model with the objective of minimizing the number of products disassembled, and a solution algorithm is suggested after deriving its optimal solution properties. Computational experiments are done on various test problems, and the results show that the algorithm suggested in this paper gives optimal solutions for the test problems within a very short amount of computation time.
- 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/181079)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.