Heuristic solution methods for the selective disassembly sequencing problem under sequence-dependent costs. (English) Zbl 1510.90087
Summary: The first Waste Framework Directive issued by the European Union dates back to the seventies but was drastically amended in the last decade to reduce environmental impacts of waste by encouraging reuse, recycling and remanufacturing. Product recovery starts with disassembly which results in high labor costs. Disassembly supports environmentally conscious choices like replacement of defective parts to extend the life span of products, removal of suitable components for reuse and extraction of hazardous substances to decontaminate materials for reprocessing. Besides, selective disassembly also accommodates maintenance and repairs. Optimizing the cost of disassembly is crucial to make this process an economically viable option. Due to change tools and parts reorientation, disassembly costs are sequence-dependent. Therefore minimizing the disassembly cost involves the search for an adequate sequence of disassembly tasks. Consequently, this paper addresses the disassembly sequencing problem for selective and sequential disassembly under sequence-dependent costs. As optimal formulations fail to handle real-world cases, we develop a randomized greedy algorithm (needing a very few number of parameters to be set and proving to be robust with respect to their value) and a matheuristic to solve efficiently medium to large-sized instances.
References:
| [1] | Adenso-Dı̀az, B.; Garcı̀a-Carbajal, S.; Gupta, S. M., A path-relinking approach for a bi-criteria disassembly sequencing problem, Comput. Oper. Res., 35, 3989-3997 (2008) · Zbl 1278.90041 |
| [2] | Alfieri, A.; Matta, A.; Pastore, E., The time buffer approximated Buffer Allocation Problem: a row-column generation approach, Comput. Oper. Res., 115, Article 104835 pp. (2020) · Zbl 1458.90224 |
| [3] | Bentaha, M.-L.; Voisin, A.; Marangé, P., A decision tool for disassembly process planning under end-of-life product quality, Int. J. Prod. Econ., 219, 386-401 (2020) |
| [4] | Chang, M. M.L.; Ong, S. K.; Nee, A. Y.C., Approaches and challenges in product disassembly planning for sustainability, Proc. CIRP, 60, 506-511 (2017) |
| [5] | Chiodoa, J. D.; Ijomahc, W. L., Use of active disassembly technology to improve remanufacturing productivity: automotive application, Int. J. Comput. Integr. Manuf., 27, 361-371 (2014) |
| [6] | Della Croce, F., Salassa, F., T’kindt, V., 2014. A hybrid heuristic approach for single machine scheduling with release times. Comput. Oper. Res. 45, 7-11. · Zbl 1348.90250 |
| [7] | Edmunds, R.; Kobayashi, M.; Higashi, M., Using constraint-satisfaction to optimise disassembly sequences generated from AND/OR information, Int. J. Prod. Res., 50, 4105-4126 (2012) |
| [8] | Go, T. F.; Wahab, D. A.; Rahman, M. N. Ab; Ramli, R.; Hussain, A., Genetically optimised disassembly sequence for automotive component reuse, Expert Syst. Appl., 39, 5409-5417 (2012) |
| [9] | Godichaud, M.; Amodeo, L., Collection-disassembly problem in reverse supply chain, Int. J. Prod. Econ., 199, 16-25 (2018) |
| [10] | Gonzalez, B.; Adenso-Dı̀az, B., A scatter search approach to the optimum disassembly sequence problem, Comput. Oper. Res., 33, 1776-1793 (2006) · Zbl 1087.90045 |
| [11] | Guerrero, W. J.; Prodhon, C.; Velasco, N.; Amaya, C. A., Hybrid heuristic for the inventory location-routing problem with deterministic demand, Int. J. Prod. Econ., 146, 359-370 (2013) |
| [12] | Güngör, A.; Gupta, S. M., An evaluation methodology for disassembly processes, Comput. Ind. Eng., 33, 329-332 (1997) |
| [13] | Güngör, A.; Gupta, S. M., Disassembly sequence plan generation using a branch-and-bound algorithm, Int. J. Prod. Res., 39, 481-509 (2001) |
| [14] | Habibi, M. K.K.; Battaïa, O.; Cung, V.-D.; Dolgui, A., Collection-disassembly problem in reverse supply chain, Int. J. Prod. Econ., 183, 334-344 (2017) |
| [15] | Han, H.-J.; Yu, J.-M.; Lee, D.-H., Mathematical model and solution algorithms for selective disassembly sequencing with multiple target components and sequence-dependent setups, Int. J. Prod. Res., 51, 4997-5010 (2013) |
| [16] | Huang, H.-H.; Wang, M. H.; Johnson, M. R., Disassembly sequence generation using a neural network approach, Comput. Oper. Res., 19, 73-82 (2000) |
| [17] | Iassinovskaia, G.; Limbourg, S.; Riane, F., The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains, Int. J. Prod. Econ., 183, 570-582 (2017) |
| [18] | Johnson, M. R.; Wang, M. H., Economical evaluation of disassembly operations for recycling, remanufacturing and reuse, Int. J. Prod. Res., 36, 3227-3252 (1998) · Zbl 0946.90507 |
| [19] | Kim, H.-W.; Lee, D.-H., An optimal algorithm for selective disassembly sequencing with sequence-dependent set-ups in parallel disassembly environment, Int. J. Prod. Res., 55, 7317-7333 (2017) |
| [20] | Kim, H.-W.; Lee, D.-H., A sample average approximation algorithm for selective disassembly sequencing with abnormal disassembly operations and random operation times, Int. J. Adv. Manuf. Technol., 96, 1341-1354 (2018) |
| [21] | Kim, H.-W.; Park, C.; Lee, D.-H., Selective disassembly sequencing with random operation times in parallel disassembly environment, Int. J. Prod. Res., 56, 7243-7257 (2018) |
| [22] | Kimms, A., Multi-Level Lot-Sizing and Scheduling. Production and Logistics (1997), Physica-Verlag Heidelberg · Zbl 0889.90056 |
| [23] | Lambert, A. J.D., Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs, Omega, 34, 538-549 (2006) |
| [24] | Lambert, A. J.D., Optimizing disassembly processes subjected to sequence-dependent cost, Comput. Oper. Res., 34, 536-551 (2007) · Zbl 1113.90029 |
| [25] | Lambert, A. J.D.; Gupta, S. M., Methods for optimum and near optimum disassembly sequencing, Int. J. Prod. Res., 46, 2845-2865 (2008) · Zbl 1141.90404 |
| [26] | Li, Jinlin; Chen, Xiaohong; Zhu, Zhanguo; Yang, Caijun; Chu, Chengbin, A branch, bound, and remember algorithm for the simple disassembly line balancing problem, Comput. Oper. Res., 105, 47-57 (2019) · Zbl 1458.90235 |
| [27] | Luo, Y.; Peng, Q.; Gu, P., Integrated multi-layer representation and ant colony search for product selective disassembly planning, Comput. Ind., 75, 13-26 (2016) |
| [28] | Official Journal of the European Union, 2012. Directive 2012/19/EU of the European Parliament and of the Council of 4 July 2012 on Waste Electrical and Electronic Equipment (WEEE). |
| [29] | Priyono, A.; Ijomah, W. L.; Bititci, U. S., Strategic operations framework for disassembly in remanufacturing, J. Remanuf., 5, 1-16 (2015) |
| [30] | Raa, B.; Dullaert, W.; Aghezzaf, E.-H., A matheuristic for aggregate production-distribution planning with mould sharing, Int. J. Prod. Econ., 145, 29-37 (2013) |
| [31] | Ren, Y.; Zhang, C.; Zhaoc, F.; Xiao, H.; Tian, G., An asynchronous parallel disassembly planning based on genetic algorithm, Eur. J. Oper. Res., 269, 647-660 (2018) · Zbl 1388.90105 |
| [32] | Smith, S.; Smith, G.; Chen, W.-H., Disassembly sequence structure graphs: an optimal approach for multiple-target selective disassembly sequence planning, Adv. Eng. Inform., 26, 306-316 (2012) |
| [33] | Soh, S. L.; Ong, S. K.; Nee, A. Y.C., Design for disassembly for remanufacturing: methodology and technology, Proc. CIRP, 15, 407-412 (2014) |
| [34] | Tian, G.; Zhou, M.; Chu, J., A chance constrained programming approach to determine the optimal disassembly sequence, IEEE Trans. Autom. Sci. Eng., 10, 1004-1013 (2012) |
| [35] | Tian, G.; Liu, Y.; Tian, Q.; Chu, J., Evaluation model and algorithm of product disassembly process with stochastic feature, Clean Technol. Environ. Policy, 14, 345-356 (2012) |
| [36] | Tian, G.; Zhou, M.; Chu, J.; Liu, Y., Probability evaluation models of product disassembly cost subject to random removal time and different removal labor cost, IEEE Trans. Autom. Sci. Eng., 9, 288-295 (2012) |
| [37] | Tian, G.; Zhou, M.; Li, P., Disassembly sequence planning considering fuzzy component quality and varying operational cost, IEEE Trans. Autom. Sci. Eng., 15, 2, 748-760 (2018) |
| [38] | Tian, G.; Ren, Y.; Feng, Y.; Zhou, M.; Zhang, H.; Tan, J., Modeling and planning for dual-objective selective disassembly using and/or graph and discrete artificial bee colony, IEEE Trans. Industr. Inf., 15, 4, 2456-2468 (2019) |
| [39] | Tian, Guangdong; Zhang, Honghao; Feng, Yixiong; Jia, Hongfei; Zhang, Chaoyong; Jiang, Zhigang; Li, Zhiwu; Li, Peigen, Operation patterns analysis of automotive components remanufacturing industry development in China, J. Clean. Prod., 164, 1363-1375 (2017) |
| [40] | Tseng, H.-E.; Chang, C.-C.; Lee, S.-C.; Huang, Y.-M., A block-based genetic algorithm for disassembly sequence planning, Expert Syst. Appl., 96, 492-505 (2018) |
| [41] | Wang, M. H.; Johnson, M. R., Design for disassembly and recyclability: a concurrent engineering approach, Concurr. Eng., 3, 131-134 (1995) |
| [42] | Yeh, W.-C., Simplified swarm optimization in disassembly sequencing problems with learning effects, Comput. Oper. Res., 39, 2168-2177 (2012) · Zbl 1251.90397 |
| [43] | Zhang, X. F.; Yu, G.; Hu, Z. Y.; Pei, C. H.; Ma, G. Q., Parallel disassembly sequence planning for complex products based on fuzzy-rough sets, Int. J. Adv. Manuf. Technol., 72, 231-239 (2014) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
