Abstract
This paper considers the problem of determining the quantity and timing of disassembling used or end-of-life products in order to satisfy the demand of their parts or components over a finite planning horizon. We focus on the case of single product type without parts commonality, i.e., assembly product structure. The objective is to minimize the sum of setup, disassembly operation, and inventory holding costs. Several properties of optimal solutions are derived, and then a branch and bound algorithm is developed based on the Lagrangian relaxation technique. Results of computational experiments on randomly generated test problems show that the algorithm finds the optimal solutions in a reasonable amount of computation time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Crowston, W.B., Wagner, M.H.: Dynamic Lot Size Models for Multi-Stage Assembly Systems. Management Science 20, 14–21 (1973)
Gupta, S.M., Taleb, K.N.: Scheduling Disassembly. International Journal of Production Research 32, 1857–1886 (1994)
Kang, J.-G., Lee, D.-H., Xirouchakis, P., Lambert, A.J.D.: Optimal Disassembly Sequencing with Sequence Dependent Operation Times based on the Directed Graph of Assembly States. Journal of the Korean Institute of Industrial Engineers 28, 264–273 (2002)
Kim, H.-J., Lee, D.-H., Xirouchakis, P., Züst, R.: Disassembly Scheduling with Multiple Product Types. CIRP Annals – Manufacturing Technology 52, 403–406 (2003)
Lee, D.-H., Kang, J.-G., Xirouchakis, P.: Disassembly Planning and Scheduling: Review and Further Research. Proceedings of the Institution of Mechanical Engineers: Journal of Engineering Manufacture – Part B 215, 695–710 (2001)
Lee, D.-H., Kim, H.-J., Choi, G., Xirouchakis, P.: Disassembly Scheduling: Integer Programming Models. Proceedings of the Institution of Mechanical Engineers: Journal of Engineering Manufacture – Part B 218, 1357–1372 (2004)
Lee, D.-H., Xirouchakis, P.: A Two-Stage Heuristic for Disassembly Scheduling with Assembly Product Structure. Journal of the Operational Research Society 55, 287–297 (2004)
Lee, D.-H., Xirouchakis, P., Züst, R.: Disassembly Scheduling with Capacity Constraints. CIRP Annals – Manufacturing Technology 51, 387–390 (2002)
Neuendorf, K.-P., Lee, D.-H., Kiritsis, D., Xirouchakis, P.: Disassembly Scheduling with Parts commonality using Petri-nets with Timestamps. Fundamenta Informaticae 47, 295–306 (2001)
Taleb, K.N., Gupta, S.M.: Disassembly of Multiple Product Structures. Computers and Industrial Engineering 32, 949–961 (1997)
Taleb, K.N., Gupta, S.M., Brennan, L.: Disassembly of Complex Product Structures with Parts and Materials Commonality. Production Planning & Control 8, 255–269 (1997)
Wagelmans, A., Hoesel, S.V., Kolen, A.: Economic Lot Sizing: an O(n log n) Algorithm that Runs in Linear Time in the Wagner-Whitin Case. Operations Research 40, 145–156 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HJ., Lee, DH., Xirouchakis, P. (2005). An Optimal Algorithm for Disassembly Scheduling with Assembly Product Structure. In: Furbach, U. (eds) KI 2005: Advances in Artificial Intelligence. KI 2005. Lecture Notes in Computer Science(), vol 3698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551263_20
Download citation
DOI: https://doi.org/10.1007/11551263_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28761-2
Online ISBN: 978-3-540-31818-7
eBook Packages: Computer ScienceComputer Science (R0)