New mixed integer approach to solve a multi-level capacitated disassembly lot-sizing problem with defective items and backlogging

Abstract

In the last few years, there has been a growing interest in the disassembly scheduling problem to fulfill the demands of individual disassembled parts over a given planning horizon. Planners have to determine the timing and the optimal quantity of ordering the end-of-life products. This paper focuses on the case of a multi-period planning problem, a single product type and multi-level structure. In this paper, we suggest a new mixed integer linear programming model for solving the capacitated disassembly scheduling problem in order to maximize total profit while minimizing of the sum of setup, inventory holding, external procurement, disposal, backlogging and overload costs in each time period. In other words, the objective function aims to (i) maximize the profit obtained by the resale of the recovered components after disassembly, from the valuation of the end-of-life products, and (ii) to minimize the costs related to the operation of disassembly process. Our computational experiments show that the proposed model gives the optimal solutions for all the test instances within acceptable time. Sensitivity studies on capacity, procurement and sale costs are also conducted, which provide some useful insights for industrial makers.

Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times

“…Gupta & Lambert (2016) highlighted the importance of disassembly lot sizing problems. Compared to the assembly process, the disassembly process is characterized by more complex operational and physical properties ( Gungor & Gupta, 1999;Slama, Ben-Ammar, Dolgui, & Masmoudi, 2020a ). The most important difference is the number of demand sources.…”

Transport Optimization of the Reverse Logistics System During Territories Sustainable Development

“…In [7] authors proposed a new mixed integer programming approach to maximize the benefit from the disassembly process, which is the difference between the income generated from the resale of remanufactured items and the costs associated with performing disassembly tasks. Several numerical tests using the wellknown CPLEX solver have proven that this new model can find the optimal disassemble schedule for most test cases in a reasonable computation time.…”

Approches d’optimisation pour un problème de planification de désassemblage sous incertitude des délais de désassemblage

“…Une grande partie de la littérature concerne le problème déterministe (voir par exemple : Guide Jr et Srivastava (1997); Gupta et Taleb (1994); Taleb et al (1997); Neuendorf et al (2001); Lee et al (2004); Kim et al (2006b); Langella (2007); Kang et al (2016); Prakash et al (2012); Kim et al (2018); Godichaud et Amodeo (2018 et très peu d'études portent sur la version avec une capacité sur la quantité de produits à désassembler (voir par exemple : Kim et al (2006a); Ullerich et Buscher (2013); Ji et al (2016); Slama et al (2020); Lee et al (2002); Kim et al (2003).…”