{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:11:17Z","timestamp":1774120277572,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T00:00:00Z","timestamp":1628553600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T00:00:00Z","timestamp":1628553600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61703220"],"award-info":[{"award-number":["61703220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2019T120569"],"award-info":[{"award-number":["2019T120569"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012906","name":"Department of Education of Shandong Province","doi-asserted-by":"crossref","award":["2020RWG011"],"award-info":[{"award-number":["2020RWG011"]}],"id":[{"id":"10.13039\/100012906","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Big data have been widely studied by numerous scholars and enterprises due to its great power in making highly reliable decisions for various complex systems. Remanufacturing systems have recently received much attention, because they play significant roles in end-of-life product recovery, environment protection and resource conservation. Disassembly is treated as a critical step in remanufacturing systems. In practice, it is difficult to know the accurate data of end-of-life products such as disassembly time because of their various usage processes, leading to the great difficulty of making effective and reliable decisions. Thus, it is necessary to model the disassembly process with stochastic programming method where the past collected data are fitted into stochastic distributions of parameters by applying big data technology. Additionally, designing and applying highly efficient intelligent optimization algorithms to handle a variety of complex problems in the disassembly process are urgently needed. To achieve the global optimization of disassembling multiple products simultaneously, this work studies a stochastic multi-product disassembly line balancing problem with maximal disassembly profit while meeting disassembly time requirements. Moreover, a chance-constrained programming model is correspondingly formulated, and then, an enhanced group teaching optimization algorithm incorporating a stochastic simulation method is developed by considering this model\u2019s features. Via performing simulation experiments on real-life cases and comparing it with five popularly known approaches, we verify the excellent performance of the designed method in solving the studied problem.<\/jats:p>","DOI":"10.1007\/s40747-021-00478-8","type":"journal-article","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T13:09:59Z","timestamp":1628600999000},"page":"4497-4512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["An enhanced group teaching optimization algorithm for multi-product disassembly line balancing problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Pei","family":"Liang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8645-6647","authenticated-orcid":false,"given":"Yaping","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Kaizhou","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,10]]},"reference":[{"key":"478_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.102141","author":"M Tang","year":"2019","unstructured":"Tang M, Liao HC (2019) From conventional group decision making to large-scale group decision making: What are the challenges and how to meet them in big data era? A state-of-the-art survey. Omega. https:\/\/doi.org\/10.1016\/j.omega.2019.102141","journal-title":"Omega"},{"key":"478_CR2","doi-asserted-by":"publisher","first-page":"4408","DOI":"10.1021\/acsomega.0c05784","volume":"6","author":"JW Roh","year":"2021","unstructured":"Roh JW, Jang SB, Kim SY, Cho H, Kim J (2021) Steam trap maintenance-prioritizing model based on big data. ACS Omega 6:4408\u20134416","journal-title":"ACS Omega"},{"key":"478_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/s40747-020-00156-1","volume":"6","author":"S Gupta","year":"2020","unstructured":"Gupta S, Garg H, Chaudhary S (2020) Parameter estimation and optimization of multi-objective capacitated stochastic transportation problem for gamma distribution. Complex Intell Syst 6:651\u2013667","journal-title":"Complex Intell Syst"},{"key":"478_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00293-1","author":"HR Chu","year":"2021","unstructured":"Chu HR, Zhang WS, Bai PF, Chen YH (2021) Data-driven optimization for last-mile delivery. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00293-1","journal-title":"Complex Intell Syst"},{"key":"478_CR5","doi-asserted-by":"publisher","first-page":"1362","DOI":"10.1016\/j.procir.2018.03.129","volume":"72","author":"ZY Ding","year":"2018","unstructured":"Ding ZY, Jiang ZG, Liu Y, Wang Y, Li CB (2018) A big data based cost prediction method for remanufacturing end-of-Life products. Procedia CIRP 72:1362\u20131367","journal-title":"Procedia CIRP"},{"key":"478_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jclepro.2017.04.172","volume":"159","author":"YF Zhang","year":"2017","unstructured":"Zhang YF, Ren S, Liu Y, Sakao T, Huisingh D (2017) A framework for Big Data driven product lifecycle management. J Clean Prod 159:229\u2013240","journal-title":"J Clean Prod"},{"key":"478_CR7","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.jclepro.2019.04.046","volume":"226","author":"YP Fu","year":"2019","unstructured":"Fu YP, Tian GD, Fathollahi-Fard AM, Ahmadi A, Zhang CY (2019) Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint. J Clean Prod 226:515\u2013525","journal-title":"J Clean Prod"},{"key":"478_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.107038","author":"SZ Cui","year":"2021","unstructured":"Cui SZ, Yin YQ, Wang DJ, Li ZW, Wang YZ (2021) A stacking-based ensemble learning method for earthquake casualty prediction. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2020.107038","journal-title":"Appl Soft Comput"},{"key":"478_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-020-00163-2","author":"HF Yu","year":"2020","unstructured":"Yu HF (2020) Evaluation of cloud computing resource scheduling based on improved optimization algorithm. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-020-00163-2","journal-title":"Complex Intell Syst"},{"key":"478_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00351-8","author":"P Agrawal","year":"2021","unstructured":"Agrawal P, Ganesh T, Mohamed AW (2021) Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm. Complex Intell Syst. https:\/\/doi.org\/10.1007\/s40747-021-00351-8","journal-title":"Complex Intell Syst"},{"key":"478_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s40747-020-00173-0","volume":"6","author":"Y Feng","year":"2020","unstructured":"Feng Y, Wang DJ, Yin YQ, Li ZW, Hu ZN (2020) An XGBoost-based casualty prediction method for terrorist attacks. Complex Intell Syst 6:721\u2013740","journal-title":"Complex Intell Syst"},{"key":"478_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107154","author":"YP Fu","year":"2021","unstructured":"Fu YP, Xiao H, Lee LH, Huang M (2021) Stochastic optimization using grey wolf optimization with optimal computing budget allocation. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2021.107154","journal-title":"Appl Soft Comput"},{"key":"478_CR13","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.jclepro.2014.09.020","volume":"85","author":"GD Tian","year":"2014","unstructured":"Tian GD, Chu J, Hu H, Li H (2014) Technology innovation system and its integrated structure for automotive components remanufacturing industry development in China. J Clean Prod 85:419\u2013432","journal-title":"J Clean Prod"},{"key":"478_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/s11356-021-14124-w","author":"P Liang","year":"2021","unstructured":"Liang P, Fu YP, Ni SY, Zheng B (2021) Modeling and optimization for noise-aversion and energy-awareness disassembly sequence planning problems in reverse supply chain. Environ Sci Pollut Res. https:\/\/doi.org\/10.1007\/s11356-021-14124-w","journal-title":"Environ Sci Pollut Res"},{"key":"478_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2016.07.006","volume":"69","author":"YQ Yin","year":"2017","unstructured":"Yin YQ, Wang Y, Cheng TCE, Liu WQ, Li JH (2017) Parallel-machine scheduling of deteriorating jobs with potential machine disruptions. Omega 69:1\u201328","journal-title":"Omega"},{"key":"478_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.omega.2015.09.010","volume":"63","author":"YQ Yin","year":"2016","unstructured":"Yin YQ, Cheng SR, Cheng TCE, Wang DJ, Wu C-C (2016) Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega 63:41\u201347","journal-title":"Omega"},{"key":"478_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cie.2015.01.002","volume":"81","author":"YQ Yin","year":"2015","unstructured":"Yin YQ, Cheng TCE, Wan L, Wu C-C, Liu J (2015) Two-agent single-machine scheduling with deteriorating jobs. Comput Ind Eng 81:177\u2013185","journal-title":"Comput Ind Eng"},{"issue":"3","key":"478_CR18","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2016.01.045","volume":"252","author":"YQ Yin","year":"2016","unstructured":"Yin YQ, Cheng TCE, Wang DJ (2016) Rescheduling on identical parallel machines with machine disruptions to minimize total completion time. Eur J Oper Res 252(3):737\u2013749","journal-title":"Eur J Oper Res"},{"key":"478_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2018.10.011","volume":"103","author":"DJ Wang","year":"2019","unstructured":"Wang DJ, Zhu JQ, Wei XW, Cheng TCE, Yin YQ, Wang YZ (2019) Integrated production and multiple trips vehicle routing with time windows and uncertain travel times. Comput Oper Res 103:1\u201312","journal-title":"Comput Oper Res"},{"issue":"7","key":"478_CR20","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1109\/JAS.2020.1003515","volume":"8","author":"XW Guo","year":"2021","unstructured":"Guo XW, Zhou MC, Abusorrah A, Alsokhiry F, Sedraoui K (2021) Disassembly sequence planning: a survey. IEEE\/CAA J Autom Sinica 8(7):1308\u20131324","journal-title":"IEEE\/CAA J Autom Sinica"},{"issue":"3","key":"478_CR21","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.ejor.2005.03.055","volume":"179","author":"SM McGovern","year":"2007","unstructured":"McGovern SM, Gupta SM (2007) A balancing method and genetic algorithm for disassembly line balancing. Eur J Oper Res 179(3):692\u2013708","journal-title":"Eur J Oper Res"},{"issue":"3","key":"478_CR22","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.ejor.2015.06.019","volume":"247","author":"ML Bentaha","year":"2015","unstructured":"Bentaha ML, Batta\u00efa O, Dolgui A, Hu SJ (2015) Second order conic approximation for disassembly line design with joint probabilistic constraints. Eur J Oper Res 247(3):957\u2013967","journal-title":"Eur J Oper Res"},{"key":"478_CR23","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1016\/j.jclepro.2017.10.308","volume":"174","author":"YP Ren","year":"2018","unstructured":"Ren YP, Zhang CY, Zhao F, Tian GD, Lin WW, Meng LL, Li HL (2018) Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm. J Clean Prod 174:1475\u20131486","journal-title":"J Clean Prod"},{"issue":"10","key":"478_CR24","first-page":"3770","volume":"50","author":"YP Ren","year":"2020","unstructured":"Ren YP, Zhang CY, Zhao F, Triebe MJ, Meng L (2020) An MCDM-cased multiobjective general variable neighborhood search approach for disassembly line balancing problem. IEEE Trans Syst Man Cybernet 50(10):3770\u20133783","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"478_CR25","doi-asserted-by":"publisher","first-page":"4805","DOI":"10.1080\/00207543.2018.1428775","volume":"57","author":"E \u00d6zceylan","year":"2019","unstructured":"\u00d6zceylan E, Kalayci CB, G\u00fcng\u00f6r A, Gupta SM (2019) Disassembly line balancing problem: a review of the state of the art and future directions. Int J Prod Res 57:4805\u20134827","journal-title":"Int J Prod Res"},{"key":"478_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100719","author":"KZ Gao","year":"2020","unstructured":"Gao KZ, He ZM, Huang Y, Duan PY, Suganthan PN (2020) A survey on meta-heuristics for solving disassembly line balancing, planning and scheduling problems in remanufacturing. Swarm Evol Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100719","journal-title":"Swarm Evol Comput"},{"key":"478_CR27","doi-asserted-by":"publisher","first-page":"4485","DOI":"10.1080\/00207540701476281","volume":"45","author":"SM McGovern","year":"2007","unstructured":"McGovern SM, Gupta SM (2007) Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem. Int J Prod Res 45:4485\u20134511","journal-title":"Int J Prod Res"},{"issue":"5","key":"478_CR28","doi-asserted-by":"publisher","first-page":"625","DOI":"10.26599\/TST.2021.9010009","volume":"26","author":"YP Fu","year":"2021","unstructured":"Fu YP, Hou YS, Wang ZF, Wu XW, Gao KZ, Wang L (2021) Distributed scheduling problems in intelligent manufacturing systems. Tsinghua Sci Technol 26(5):625\u2013645","journal-title":"Tsinghua Sci Technol"},{"key":"478_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.eswa.2017.05.053","volume":"86","author":"ZQ Zhang","year":"2017","unstructured":"Zhang ZQ, Wang KP, Zhu LX, Wang Y (2017) A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem. Expert Syst Appl 86:165\u2013176","journal-title":"Expert Syst Appl"},{"issue":"6","key":"478_CR30","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1080\/00207540600943985","volume":"46","author":"S Agrawal","year":"2008","unstructured":"Agrawal S, Tiwari MK (2008) A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. Int J Prod Res 46(6):1405\u20131429","journal-title":"Int J Prod Res"},{"key":"478_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.rcim.2019.04.014","volume":"59","author":"KP Wang","year":"2019","unstructured":"Wang KP, Li XY, Gao L, Garg A (2019) Partial disassembly line balancing for energy consumption and profit under uncertainty. Robot Comput-Integr Manuf 59:235\u2013251","journal-title":"Robot Comput-Integr Manuf"},{"key":"478_CR32","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.jmsy.2020.06.013","volume":"56","author":"LX Zhu","year":"2020","unstructured":"Zhu LX, Zhang ZQ, Guan C (2020) Multi-objective partial parallel disassembly line balancing problem using hybrid group neighbourhood search algorithm. J Manuf Syst 56:252\u2013269","journal-title":"J Manuf Syst"},{"key":"478_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00170-013-4990-1","volume":"69","author":"CB Kalayci","year":"2013","unstructured":"Kalayci CB, Gupta SM (2013) A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem. Int J Adv Manuf Technol 69:197\u2013209","journal-title":"Int J Adv Manuf Technol"},{"key":"478_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107404","author":"KP Wang","year":"2021","unstructured":"Wang KP, Li XY, Gao L, Li PG, Gupta SM (2021) A genetic simulated annealing algorithm for parallel partial disassembly line balancing problem. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2021.107404","journal-title":"Appl Soft Comput"},{"key":"478_CR35","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.apm.2020.05.006","volume":"86","author":"ZA \u00c7il","year":"2020","unstructured":"\u00c7il ZA, Mete S, Serin F (2020) Robotic disassembly line balancing problem: a mathematical model and ant colony optimization approach. Appl Math Model 86:335\u2013348","journal-title":"Appl Math Model"},{"key":"478_CR36","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1744765","author":"QX Xiao","year":"2020","unstructured":"Xiao QX, Guo XP, Li D (2020) Partial disassembly line balancing under uncertainty: robust optimisation models and an improved migrating birds optimisation algorithm. Int J Prod Res. https:\/\/doi.org\/10.1080\/00207543.2020.1744765","journal-title":"Int J Prod Res"},{"key":"478_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.121829","author":"KP Wang","year":"2020","unstructured":"Wang KP, Li XY, Gao L, Li PG (2020) Energy consumption and profit-oriented disassembly line balancing for waste electrical and electronic equipment. J Clean Prod. https:\/\/doi.org\/10.1016\/j.jclepro.2020.121829","journal-title":"J Clean Prod"},{"key":"478_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113246","author":"YY Zhang","year":"2020","unstructured":"Zhang YY, Jin ZG (2020) Group teaching optimization algorithm: a novel metaheuristic method for solving global optimization problems. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2020.113246","journal-title":"Expert Syst Appl"},{"key":"478_CR39","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995 - International Conference on Neural Networks 4:1942\u20131948 Perth, Australia.","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"24","key":"478_CR40","doi-asserted-by":"publisher","first-page":"7302","DOI":"10.1080\/00207543.2017.1341066","volume":"55","author":"YP Ren","year":"2017","unstructured":"Ren YP, Yu DY, Zhang CY, Tian GD, Meng LL, Zhou XQ (2017) An improved gravitational search algorithm for profit-oriented partial disassembly line balancing problem. Int J Prod Res 55(24):7302\u20137316","journal-title":"Int J Prod Res"},{"issue":"2","key":"478_CR41","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1108\/JMTM-11-2013-0168","volume":"26","author":"CB Kalayci","year":"2015","unstructured":"Kalayci CB, Polat O, Gupta SM (2015) A variable neighbourhood search algorithm for disassembly lines. J Manuf Technol Manag 26(2):182\u2013194","journal-title":"J Manuf Technol Manag"},{"key":"478_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.121829","author":"KP Wang","year":"2021","unstructured":"Wang KP, Li XY, Gao L, Li PG, Gupta SM (2021) Energy consumption and profit-oriented disassembly line balancing for waste electrical and electronic equipment. J Clean Prod. https:\/\/doi.org\/10.1016\/j.jclepro.2020.121829","journal-title":"J Clean Prod"},{"issue":"2","key":"478_CR43","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TASE.2017.2690802","volume":"15","author":"GD Tian","year":"2018","unstructured":"Tian GD, Zhou MC, Li PG (2018) Disassembly sequence planning considering fuzzy component quality and varying operational cost. IEEE Trans Autom Sci Eng 15(2):748\u2013760","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"3","key":"478_CR44","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1109\/TASE.2017.2731981","volume":"15","author":"XW Guo","year":"2018","unstructured":"Guo XW, Liu SX, Zhou MC, Tian GD (2018) Dual-objective program and scatter search for the optimization of disassembly sequences subject to multiresource constraints. IEEE Trans Autom Sci Eng 15(3):1091\u20131103","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"4","key":"478_CR45","doi-asserted-by":"publisher","first-page":"2456","DOI":"10.1109\/TII.2018.2884845","volume":"15","author":"GD Tian","year":"2019","unstructured":"Tian GD, Ren YP, Feng YX, Zhou MC, Zhang HH, Tan JR (2019) Modeling and planning for dual-objective selective disassembly using AND\/OR graph and discrete artificial bee colony. IEEE Trans Industr Inf 15(4):2456\u20132468","journal-title":"IEEE Trans Industr Inf"},{"key":"478_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.123364","author":"YP Fu","year":"2020","unstructured":"Fu YP, Zhou MC, Guo XW, Qi L (2020) Stochastic multi-objective integrated disassembly-reprocessing-reassembly scheduling via fruit fly optimization algorithm. J Clean Prod. https:\/\/doi.org\/10.1016\/j.jclepro.2020.123364","journal-title":"J Clean Prod"},{"key":"478_CR47","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1016\/j.cie.2019.03.017","volume":"130","author":"KP Wang","year":"2019","unstructured":"Wang KP, Li XY, Gao L (2019) A multi-objective discrete flower pollination algorithm for stochastic two-sided partial disassembly line balancing problem. Comput Ind Eng 130:634\u2013649","journal-title":"Comput Ind Eng"},{"key":"478_CR48","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3049323","author":"YP Fu","year":"2020","unstructured":"Fu YP, Zhou MC, Guo XW, Qi L, Sedraoui K (2020) Multiverse optimization algorithm for stochastic biobjective disassembly sequence planning subject to operation failures. IEEE Trans Syst Man Cybernet. https:\/\/doi.org\/10.1109\/TSMC.2021.3049323","journal-title":"IEEE Trans Syst Man Cybernet"},{"issue":"3","key":"478_CR49","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1109\/TASE.2005.860989","volume":"3","author":"Y Tang","year":"2006","unstructured":"Tang Y, Zhou MC (2006) A systematic approach to design and operation of disassembly lines. IEEE Trans Autom Sci Eng 3(3):324\u2013329","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"2","key":"478_CR50","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/TASE.2011.2176489","volume":"9","author":"GD Tian","year":"2012","unstructured":"Tian GD, Zhou MC, Chu JW, Liu YM (2012) Probability evaluation models of product disassembly cost subject to random removal time and different removal labor cost. IEEE Trans Autom Sci Eng 9(2):288\u2013295","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"478_CR51","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9111962","author":"MH Zafar","year":"2020","unstructured":"Zafar MH, Al-shahrani T, Khan NM, Feroz Mirza A, Mansoor M, Qadir MU, Khan MI, Naqvi RA (2020) Group teaching optimization algorithm based MPPT Control of PV systems under partial shading and complex partial shading. Electronics. https:\/\/doi.org\/10.3390\/electronics9111962","journal-title":"Electronics"},{"key":"478_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107198","author":"SK Zhu","year":"2021","unstructured":"Zhu SK, Wu Q, Jiang YX, Xing W (2021) A novel multi-objective group teaching optimization algorithm and its application to engineering design. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2021.107198","journal-title":"Comput Ind Eng"},{"key":"478_CR53","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.3014093","author":"YP Fu","year":"2020","unstructured":"Fu YP, Wang HF, Wang JW, Pu XJ (2020) Multi-objective modelling and optimization for scheduling a stochastic hybrid flow with maximizing processing quality and minimizing total tardiness. IEEE Syst J. https:\/\/doi.org\/10.1109\/JSYST.2020.3014093","journal-title":"IEEE Syst J"},{"issue":"12","key":"478_CR54","doi-asserted-by":"publisher","first-page":"5037","DOI":"10.1109\/TSMC.2019.2907575","volume":"50","author":"YP Fu","year":"2020","unstructured":"Fu YP, Zhou MC, Guo XW, Qi L (2020) Scheduling dual-objective stochastic hybrid flow shop with deteriorating jobs via bi-population evolutionary algorithm. IEEE Trans Syst Man Cybernet 50(12):5037\u20135048","journal-title":"IEEE Trans Syst Man Cybernet"},{"key":"478_CR55","doi-asserted-by":"publisher","first-page":"9617","DOI":"10.1007\/s00500-018-3525-y","volume":"23","author":"DJ Wang","year":"2019","unstructured":"Wang DJ, Qiu HX, Wu C-C, Lin W-C, Lai KJ, Cheng S-R (2019) Dominance rule and opposition-based particle swarm optimization for two-stage assembly scheduling with time cumulated learning effect. Soft Comput 23:9617\u20139628","journal-title":"Soft Comput"},{"key":"478_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106632","author":"XW Wei","year":"2020","unstructured":"Wei XW, Qiu HX, Wang DJ, Duan JH, Wang YZ, Cheng TCE (2020) An integrated location-routing problem with post-disaster relief distribution. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2020.106632","journal-title":"Comput Ind Eng"},{"issue":"2","key":"478_CR57","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.cor.2005.03.012","volume":"46","author":"AJD Lambert","year":"2007","unstructured":"Lambert AJD (2007) Optimization disassembly processes subjected to sequence-dependent cost. Comput Oper Res 46(2):536\u2013551","journal-title":"Comput Oper Res"},{"key":"478_CR58","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2992220","author":"XW Guo","year":"2020","unstructured":"Guo XW, Zhou MC, Liu SX, Qi L (2020) Multiresource-constrained selective disassembly with maximal profit and minimal energy consumption. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2020.2992220","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"478_CR59","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2005","unstructured":"Montgomery DC (2005) Design and analysis of experiments. Wiley, Hoboken"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00478-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00478-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00478-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:53:14Z","timestamp":1725601994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00478-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,10]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["478"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00478-8","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,10]]},"assertion":[{"value":"26 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}