Disassembly scheduling is the problem of determining the timing and quantity of disassembling used products to satisfy the demands of their parts or components over the planning horizon. This paper focuses on the case of single product type without parts commonality while the resource capacity restrictions are explicitly considered. The problem is formulated as an integer program for the objective of minimizing the number of products to be disassembled, and an optimal algorithm, after deriving the properties of the problem, is suggested. Computational experiments are done on randomly generated test problems, and the results are reported. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kim, J. G., Jeon, H. B., Kim, H. J., Lee, D. H., & Xirouchakis, P. (2005). Capacitated disassembly scheduling: Minimizing the number of products disassembled. In Lecture Notes in Computer Science (Vol. 3483, pp. 538–547). Springer Verlag. https://doi.org/10.1007/11424925_57
Mendeley helps you to discover research relevant for your work.