A Heuristic for Service-Parts Lot-Sizing with Disassembly Option
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Due to increasing awareness on the treatment of end-of-use/life products, disassembly has been a fast-growing research area of interest for many researchers over recent decades. This paper introduces a novel lot-sizing problem that has not been studied in the literature, which is the service-parts lot-sizing with disassembly option. The disassembly option implies that the demands of service parts can be fulfilled by newly manufactured parts, but also by disassembled parts. The disassembled parts are the ones recovered after the disassembly of end-of-use/life products. The objective of the considered problem is to maximize the total profit, i.e., the revenue of selling the service parts minus the total cost of the fixed setup, production, disassembly, inventory holding, and disposal over a planning horizon. This paper proves that the single-period version of the considered problem is NP-hard and suggests a heuristic by combining a simulated annealing algorithm and a linear-programming relaxation. Computational experiment results show that the heuristic generates near-optimal solutions within reasonable computation time, which implies that the heuristic is a viable optimization tool for the service parts inventory management. In addition, sensitivity analyses indicate that deciding an appropriate price of disassembled parts and an appropriate collection amount of EOLs are very important for sustainable service parts systems.
Abstract
Due to increasing awareness on the treatment of end-of-use/life products, disassembly has been a fast-growing research area of interest for many researchers over recent decades. This paper introduces a novel lot-sizing problem that has not been studied in the literature, which is the service-parts lot-sizing with disassembly option. The disassembly option implies that the demands of service parts can be fulfilled by newly manufactured parts, but also by disassembled parts. The disassembled parts are the ones recovered after the disassembly of end-of-use/life products. The objective of the considered problem is to maximize the total profit, i.e., the revenue of selling the service parts minus the total cost of the fixed setup, production, disassembly, inventory holding, and disposal over a planning horizon. This paper proves that the single-period version of the considered problem is NP-hard and suggests a heuristic by combining a simulated annealing algorithm and a linear-programming relaxation. Computational experiment results show that the heuristic generates near-optimal solutions within reasonable computation time, which implies that the heuristic is a viable optimization tool for the service parts inventory management. In addition, sensitivity analyses indicate that deciding an appropriate price of disassembled parts and an appropriate collection amount of EOLs are very important for sustainable service parts systems.
참고문헌 (31)
- Attila, O. N., "Robust Formulations for Economic Lot-Sizing Problem with Remanufacturing", European Journal of Operational Research, 288(2), pp.496~510 (2021)
- Baki, M. F., "A Heuristic Solution Procedure for the Dynamic Lot Sizing Problem with Remanufacturing and Product Recovery", Computers and Operations Research, 43, pp.225~236 (2014)
- Fleischmann, M., "Integrating Closed-Loop Supply Chains and Spare-Parts Management at IBM", Interfaces, 33(6), pp.44~56 (2003)
- Garey, M.R., "Computers and Intractability : A Guide to the Theory of NP-Completeness" (1979), W.H. Freeman & Company
- Godichaud, M., "Economic Order Quantity for Multistage Disassembly Systems", International Journal of Production Economics, 199, pp.16~25 (2018)
- Godichaud, M., "EOQ Inventory Models for Disassembly Systems with Disposal and Lost Sales", International Journal of Production Research, 57(18), pp.5685~5704 (2018)
- Golany, B., "Economic Lot-Sizing with Remanufacturing Options", IIE Transactions, 33(11), pp.995~1003 (2001)
- Gupta, S.M., "Scheduling Disassembly", International Journal of Production Research, 32(8), pp.1857~1866 (1994)
- 전형배, "A Two-Stage Heuristic for Disassembly Scheduling with Capacity Constraints", MSFE, 12(1), pp.95~112 (2006), 한국경영과학회
- Ji, X., "Capacitated Disassembly Scheduling with Parts Commonality and Start-Up Cost and its Industrial Application", International Journal of Production Research, 54(4), pp.1225~1243 (2016)
- Kim, H.-J., "Capacitated Disassembly Scheduling with Random Demand", International Journal of Production Research, 48(23), pp.7177~7194 (2010)
- Kim, H. -J., "A Lagrangean Heuristic Algorithm for Disassembly Scheduling with Capacity Constraints", Journal of the Operational Research Society, 57, pp.1231~1240 (2006)
- 김화중, "An Exact Algorithm for Two-Level Disassembly Scheduling", 대한산업공학회지, 34(4), pp.414~424 (2008), 대한산업공학회
- Kim, H. -J., "Disassembly scheduling : Literature Review and Future Research Directions", International Journal of Production Research, 45, pp.4465~4484 (2007)
- Kim, H. -J., "Two-Phase Heuristic for Disassembly Scheduling with Multiple Product Types and Parts Commonality", International Journal of Production Research, 44, pp.195~212 (2006)
- Kim, H. -J., "A Branch and Bound Algorithm for Disassembly Scheduling with Assembly Product Structure", Journal of the Operational Research Society, 60(3), pp.419~430 (2009)
- Kim, H. -J., "Disassembly Scheduling with Multiple Product Types", CIRP Annals-Manufacturing Technology, 52(1), pp.403~406 (2003)
- Kim, J. -G., "Disassembly Scheduling with Capacity Constraints : Minimizing the Number of Products Disassembled", Proceedings of the Institution of Mechanical Engineers, 220, pp.1473~1481 (2006)
- Langella, I. M., "Heuristics for Demand-Driven Disassembly Planning", Computers and Operations Research, 34(2), pp.552~577 (2007)
- Lee, D.-H., "A Two-Stage Heuristic for Disassembly Scheduling with Assembly Product Structure", Journal of the Operational Research Society, 55(3), pp.287~297 (2004)
- Lee, D. -H., "Disassembly Scheduling : Integer Programming Models", Proceedings of the Institution of Mechanical Engineers, Journal of Engineering Manufacture-Part B, 218(10), pp.1357~1372 (2004)
- Lee, D. -H., "Disassembly Scheduling with Capacity Constraints", CIRP Annals-Manufacturing Technology, 51(1), pp.387~390 (2002)
- Neuendorf, K. -P., "Disassembly Scheduling with Parts Commonality Using Petri Nets with timestamps", Fundamenta, Informaticae, 47, pp.295~306 (2001)
- Pan, Z., "Capacitated Dynamic Lot Sizing Problems in Closed-Loop Supply Chain", European Journal of Operational Research, 198(3), pp.810~821 (2009)
- Pineyro, P., "The Economic Lot-Sizing Problem with Remanufacturing and One-Way Substitution", International Journal of Production Economics, 124(2), pp.482~488 (2010)
- Sifaleras, A., "Variable Neighborhood Search for the Economic lot Sizing Problem with Product Returns and Recovery", International Journal of Production Economics, 160, pp.133~143 (2015)
- Son, D.-H, "Push and Pull Disassembly Quantity Models in a Reverse Supply Chain : The Case of an Automobile Disassem bly System in Korea", International Journal of Logistics Research and Applications, pp.1~26 (2021)
- Taleb, K.N., "Disassembly of Multiple Product Structures", Computers & Industrial Engineering, 32, pp.949~961 (1997)
- Taleb, K. N., "Disassembly of Complex Product Structures with Parts and Materials Commonality", Production Planning and Control, 8, pp.255~269 (1997)
- Teunter, R. H., "Dynamic Lot Sizing with Product Returns and Remanufacturing", International Journal of Production Research, 44(20), pp.4377~4400 (2006)
- Yang, J., "A Concave-Cost Production Planning Problem with Remanufacturing Options", Naval Research Logistics, 52(5), pp.443~458 (2005)