Disassembly leveling and lot-sizing is an integrated problem of determining the depth of disassembling a product and the resulting amounts of disassembling the product and its subassemblies to satisfy component demands. This study addresses two stochastic versions of the problem for multiple product types with uncertain component demands: a basic problem and its extension with parts commonality. The objective is to minimize the sum of expected setup and operation costs. For the basic problem without parts commonality, an optimal sample average approximation algorithm is proposed and then illustrated with a numerical example after formulating it as a stochastic integer programing model. Also, due to the complexity of the extended problem, sample average approximation based heuristics are proposed and computational results are reported. In particular, the results show that the best heuristic gives near optimal solutions for small sized test instances.
MebratuD. Sustainability and sustainable development: Historical and conceptual review. Environ Impact Assess Rev1998; 18(6): 493–520.
2.
RobèrtK-HSchmidt-BleekBAloisi de LarderelJ, et al. Strategic sustainable development: selection, design and synergies of applied tools. J Clean Prod2002; 10(3): 197–214.
3.
FleischmannMBloemhof-RuwaardJMDekkerR, et al. Quantitative models for reverse logistics: a review. Eur J Oper Res1997; 103(1): 1–17.
4.
GovindanKSoleimaniHKannanD. Reverse logistics and closed-loop supply chain: a comprehensive review to explore the future. Eur J Oper Res2015; 240(3): 603–626.
5.
PrajapatiHKantRShankarR. Bequeath life to death: state-of-art review on reverse logistics. J Clean Prod2019; 211: 503–520.
6.
TianGYuanGAleksandrovA, et al. Recycling of spent lithium-ion batteries: a comprehensive review for identification of main challenges and future research trends. Sustain Energy Technol Assess2022; 53: 102447.
7.
ÖzceylanEKalayciCBGüngörA, et al. Disassembly line balancing problem: a review of the state of the art and future directions. Int J Prod Res2019; 57(15-16): 4805–4827.
8.
ZhouZLiuJPhamDT, et al. Disassembly sequence planning: recent developments and future trends. Proc IMechE, Part B: J Engineering Manufacture2019; 233(5): 1450–1471.
9.
OngSKChangMMLNeeAYC. Product disassembly sequence planning: state-of-the-art, challenges, opportunities and future directions. Int J Prod Res2021; 59(11): 3493–3508.
10.
KimH-JLeeD-HXirouchakisP. Disassembly scheduling: literature review and future research directions. Int J Prod Res2007; 45(18-19): 4465–4484.
11.
PenevKDde RonAJ. Determination of a disassembly strategy. Int J Prod Res1996; 34(2): 495–506.
12.
MeachamAUzsoyRVenkatadriU. Optimal disassembly configurations for single and multiple products. J Manuf Syst1999; 18(5): 311–322.
13.
JohnsonMRWangMH. Economical evaluation of disassembly operations for recycling, remanufacturing and reuse. Int J Prod Res1998; 36(12): 3227–3252.
14.
KangJ-GLeeD-HXirouchakisP, et al. Parallel disassembly sequencing with sequence-dependent operation times. CIRP Ann2001; 50(1): 343–346.
SmithSHsuLYSmithGC. Partial disassembly sequence planning based on cost-benefit analysis. J Clean Prod2016; 139: 729–739.
17.
TianGRenYFengY, et al. Modeling and planning for dual-objective selective disassembly using AND/OR graph and discrete artificial bee colony. IEEE Trans Ind Inform2019; 15(4): 2456–2468.
18.
ChenD-ZWeiCJiaG-L, et al. Shortest-path optimization of ship diesel engine disassembly and assembly based on AND/OR network. Complexity2020; 2020: 1–15.
19.
FuYZhouMGuoX, et al. Multiverse optimization algorithm for stochastic biobjective disassembly sequence planning subject to operation failures. IEEE Trans Syst Man Cybern Syst2022; 52(2): 1041–1051.
20.
QiuLDongLWangZ, et al. Asynchronous parallel disassembly sequence planning method of complex products using discrete multi-objective optimization. Proc IMechE, Part B: J Engineering Manufacture2022; 236(11): 1466–1482.
21.
ZhangLWuYLiZ, et al. A systematic approach in remanufacturing for high efficiency and low cost: the selective parallel disassembly sequence planning. Proc IMechE, Part B: J Engineering Manufacture2022; 236(5): 572–585.
22.
PnueliYZussmanE. Evaluating the end-of-life value of a product and improving it by redesign. Int J Prod Res1997; 35(4): 921–942.
23.
ErdosGKisTXirouchakisP. Modelling and evaluating product end-of-life options. Int J Prod Res2001; 39(6): 1203–1220.
24.
TeunterRH. Determining optimal disassembly and recovery strategies. Omega2006; 34(6): 533–537.
25.
MaYSJunH-BKimH-W, et al. Disassembly process planning algorithms for end-of-life product recovery and environmentally conscious disposal. Int J Prod Res2011; 49(23): 7007–7027.
26.
MengKLouPPengX, et al. An improved co-evolutionary algorithm for green manufacturing by integration of recovery option selection and disassembly planning for end-of-life products. Int J Prod Res2016; 54(18): 5567–5593.
27.
BahubalendruniMVARVarupalaVP. Disassembly sequence planning for safe disposal of end-of-life waste electric and electronic equipment. Natl Acad Sci Lett2021; 44: 243–247.
28.
GunjiBMPabbaSKRajaramIRS, et al. Optimal disassembly sequence generation and disposal of parts using stability graph cut-set method for end of life product. Sādhanā2021; 46(1): 21.
29.
GulivindalaAKBahubalendruniMVARPrasadVSS, et al. A multi-layered disassembly sequence planning method to support decision making in de-manufacturing. Sādhanā2021; 46(2): 102.
30.
GulivindalaAKBahubalendruniMVARChandrasekarR, et al. Automated disassembly sequence prediction for Industry 4.0 using enhanced genetic algorithm. Computers, Materials & Continua2021; 69(2): 2531–2548.
31.
GuptaSMTalebKN. Scheduling disassembly. Int J Prod Res1994; 32(8): 1857–1866.
32.
LeeD-HXirouchakisP. A two-stage heuristic for disassembly scheduling with assembly product structure. J Oper Res Soc2004; 55(3): 287–297.
33.
KimH-JLeeD-HXirouchakisP, et al. A branch and bound algorithm for disassembly scheduling with assembly product structure. J Oper Res Soc2009; 60(3): 419–430.
34.
TianXZhangZ-H. Capacitated disassembly scheduling and pricing of returned products with price-dependent yield. Omega2019; 84: 160–174.
35.
LambertAJDGuptaSM. Demand-driven disassembly optimization for electronic products package reliability. J Electron Manuf2002; 11(02): 121–135.
36.
KimH-JLeeD-HXirouchakisP, et al. Disassembly scheduling with multiple product types. CIRP Ann2003; 52: 403–406.
37.
KimH-JLeeD-HXirouchakisP. Two-phase heuristic for disassembly scheduling with multiple product types and parts commonality. Int J Prod Res2006; 44(1): 195–212.
SlamaIBen-AmmarOMasmoudiF, et al. Scenario-based stochastic linear programming model for multi-period disassembly lot-sizing problems under random lead time. IFAC-PapersOnLine2019; 52(13): 595–600.
40.
SlamaIBen-AmmarODolguiA, et al. New mixed integer approach to solve a multi-level capacitated disassembly lot-sizing problem with defective items and backlogging. J Manuf Syst2021; 56: 50–57.
41.
SlamaIBen-AmmarODolguiA, et al. Genetic algorithm and Monte Carlo simulation for a stochastic capacitated disassembly lot-sizing problem under random lead times. Comput Ind Eng2021; 159: 107468.
42.
Pour-Massahian-TaftiMGodichaudMAmodeoL. New models and efficient methods for single-product disassembly lot-sizing problem with surplus inventory decisions. Int J Prod Res2021; 59(22): 6898–6918.
43.
KangK-WDohH-HParkJ-H, et al. Disassembly leveling and lot sizing for multiple product types: a basic model and its extension. Int J Adv Manuf Technol2016; 82(9-12): 1463–1473.
44.
KimD-HDohH-HLeeD-H. Multi-period disassembly levelling and lot-sizing for multiple product types with parts commonality. Proc IMechE, Part B: J Engineering Manufacture2018; 232(5): 867–878.
45.
KleywegtAJShapiroAHomem-de-MelloT. The sample average approximation method for stochastic discrete optimization. SIAM J Optim2002; 12(2): 479–502.
46.
MakWKMortonDPWoodRK. Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper Res Lett1999; 24(1-2): 47–56.
47.
NorkinVIPflugGCRuszczyńskiA. A branch and bound method for stochastic global optimization. Math Program1998; 83(1-3): 425–450.
