Disassembly scheduling with capacity constraints: minimizing the number of products disassembled

Title
Disassembly scheduling with capacity constraints: minimizing the number of products disassembled
Authors
Kim, H.J.
Keywords
planning and scheduling, disassembly systems
Issue Date
2006-09
Publisher
PROFESSIONAL ENGINEERING PUBLISHING LTD
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.
URI
http://dspace.inha.ac.kr/handle/10505/1645
ISSN
0954-4054
Appears in Collections:
College of Business Administration (경영대학) > Logistics (아태물류학부) > Journal Papers, Reports(물류학 학술논문,보고서)
Files in This Item:
Disassembly.pdfDownload

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse