Abstract
We consider the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. This paper focuses on the capacitated version of the problem for the objective of minimizing the sum of setup, disassembly operation, and inventory holding costs. The problem is formulated as an integer program, and to solve the problem, a Lagrangean heuristic algorithm is developed after reformulating the integer program. To show the performance of the heuristic algorithm, computational experiments are done on randomly generated test problems, and the test results show that the algorithm suggested in this paper works well.
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
Gupta, S.M., Taleb, K.N.: Scheduling Disassembly. International Journal of Production Research 32, 1857–1886 (1994)
Kim, H.-J., Lee, D.-H., Xirouchakis, P., Züst, R.: Disassembly Scheduling with Multiple Product Types. Annals of the CIRP 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. Annals of the CIRP 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 and 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). A Lagrangean Relaxation Approach for Capacitated Disassembly Scheduling. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_76
Download citation
DOI: https://doi.org/10.1007/11424925_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25863-6
Online ISBN: 978-3-540-32309-9
eBook Packages: Computer ScienceComputer Science (R0)