{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T04:49:28Z","timestamp":1745642968666,"version":"3.38.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-03796-7","type":"journal-article","created":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T09:58:49Z","timestamp":1741600729000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Novel Deep Reinforcement Learning Approach for Stability-Based Parallel Disassembly Sequence Planning Problem"],"prefix":"10.1007","volume":"6","author":[{"given":"M. R. Mahesh","family":"Kumar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6338-242X","authenticated-orcid":false,"given":"Chandrasekar","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"3796_CR1","doi-asserted-by":"publisher","DOI":"10.1108\/eb004372","author":"K Yokota","year":"1992","unstructured":"Yokota K, Brough D. Assembly\/disassembly sequence planning. Assem Autom. 1992. https:\/\/doi.org\/10.1108\/eb004372.","journal-title":"Assem Autom"},{"key":"3796_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirpj.2022.11.017","author":"M Chand","year":"2023","unstructured":"Chand M, Ravi C. A state-of-the-art literature survey on artificial intelligence techniques for disassembly sequence planning. CIRP J Manuf Sci Technol. 2023. https:\/\/doi.org\/10.1016\/j.cirpj.2022.11.017.","journal-title":"CIRP J Manuf Sci Technol"},{"key":"3796_CR3","doi-asserted-by":"publisher","DOI":"10.1177\/0954405418789975","author":"Z Zhou","year":"2018","unstructured":"Zhou Z, Liu J, Pham DT, Xu W, Ramirez FJ, Ji C, Liu Q. Disassembly sequence planning: recent developments and future trends. Proc Inst Mechanical Eng Part B J Eng Manuf. 2018. https:\/\/doi.org\/10.1177\/0954405418789975.","journal-title":"Proc Inst Mechanical Eng Part B J Eng Manuf."},{"key":"3796_CR4","doi-asserted-by":"publisher","DOI":"10.1115\/1.2803269","author":"D Dutta","year":"1995","unstructured":"Dutta D, Woo TC. Algorithm for multiple disassembly and parallel assemblies. J Eng Industry. 1995. https:\/\/doi.org\/10.1115\/1.2803269.","journal-title":"J Eng Industry"},{"issue":"1115\/1","key":"3796_CR5","first-page":"2826246","volume":"10","author":"SF Chen","year":"1997","unstructured":"Chen SF, Oliver JH, Chou SY, Chen LL. Parallel disassembly by onion peeling. J Mech Des DOI. 1997;10(1115\/1):2826246.","journal-title":"J Mech Des. DOI"},{"key":"3796_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/S0007-8506(07)62136-2","author":"JG Kang","year":"2001","unstructured":"Kang JG, Lee DH, Xirouchakis P, Persson JG. Parallel disassembly sequencing with sequence-dependent operation times. CIRP Ann. 2001. https:\/\/doi.org\/10.1016\/S0007-8506(07)62136-2.","journal-title":"CIRP Ann"},{"key":"3796_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9780203487174","volume-title":"Disassembly modeling for assembly, maintenance, reuse and recycling","author":"AJD Lambert","year":"2004","unstructured":"Lambert AJD, Gupta SM. Disassembly modeling for assembly, maintenance, reuse and recycling. 1st ed. Boca Raton: CRC Press; 2004.","edition":"1"},{"key":"3796_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-023-02160-w","author":"AK Gulivindala","year":"2023","unstructured":"Gulivindala AK, Bahubalendruni MVAR, Eswaran M. Mechanical disassembly sequence planning for end-of-life products to maximize recyclability. S\u0101dhan\u0101. 2023. https:\/\/doi.org\/10.1007\/s12046-023-02160-w.","journal-title":"S\u0101dhan\u0101"},{"key":"3796_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-021-01622-3","author":"G Anil Kumar","year":"2021","unstructured":"Anil Kumar G, Bahubalendruni MVAR, Prasad VSS, Sankaranarayanasamy K. A multi-layered disassembly sequence planning method to support decision making in de-manufacturing. S\u0101dhan\u0101. 2021. https:\/\/doi.org\/10.1007\/s12046-021-01622-3.","journal-title":"S\u0101dhan\u0101"},{"key":"3796_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-020-01525-9","author":"BM Gunji","year":"2021","unstructured":"Gunji BM, Pabba SK, Rajaram IRS, Sorakayala PS, Dubey A, Deepak BBVL, Biswal BB, Bahubalendruni MVAR. Optimal disassembly sequence generation and disposal of parts using stability graph cut-set method for End of Life product. S\u0101dhan\u0101. 2021. https:\/\/doi.org\/10.1007\/s12046-020-01525-9.","journal-title":"S\u0101dhan\u0101"},{"key":"3796_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060424000039","author":"M Chand","year":"2024","unstructured":"Chand M, Ravi C. A novel reinforcement learning framework for disassembly sequence planning using Q-learning technique optimized using an enhanced simulated annealing algorithm. Artif Intell Eng Des Anal Manuf. 2024. https:\/\/doi.org\/10.1017\/S0890060424000039.","journal-title":"Artif Intell Eng Des Anal Manuf"},{"key":"3796_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2023.103992","author":"A Allagui","year":"2023","unstructured":"Allagui A, Belhadj I, Plateaux R, Hammadi M, Penas O, Aifaoui N. Reinforcement learning for disassembly sequence planning optimization. Comput Ind. 2023. https:\/\/doi.org\/10.1016\/j.compind.2023.103992.","journal-title":"Comput Ind"},{"key":"3796_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/lra.2021.3098248","author":"X Zhao","year":"2021","unstructured":"Zhao X, Li C, Tang Y, Cui J. Reinforcement learning-based selective disassembly sequence planning for the end-of-life products with structure uncertainty. IEEE Robot Autom Lett. 2021. https:\/\/doi.org\/10.1109\/lra.2021.3098248.","journal-title":"IEEE Robot Autom Lett"},{"key":"3796_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108855","author":"X Sun","year":"2023","unstructured":"Sun X, Guo S, Guo J, Du B. A two-stage interactive evolutionary algorithm for multi-objective asynchronous parallel selective disassembly sequence planning problem. Comput Ind Eng. 2023. https:\/\/doi.org\/10.1016\/j.cie.2022.108855.","journal-title":"Comput Ind Eng"},{"key":"3796_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2682-7","author":"XF Zhang","year":"2010","unstructured":"Zhang XF, Zhang SY. Product cooperative disassembly sequence planning based on branch-and-bound algorithm. Int J Adv Manuf Technol. 2010. https:\/\/doi.org\/10.1007\/s00170-010-2682-7.","journal-title":"Int J Adv Manuf Technol"},{"key":"3796_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.06.025","author":"Y Ren","year":"2017","unstructured":"Ren Y, Tian G, Zhao F, Yu D, Zhang C. Selective cooperative disassembly planning based on multi-objective discrete artificial bee colony algorithm. Eng Appl Artif Intell. 2017. https:\/\/doi.org\/10.1016\/j.engappai.2017.06.025.","journal-title":"Eng Appl Artif Intell"},{"key":"3796_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-020-2680-9","author":"JF Zhu","year":"2020","unstructured":"Zhu JF, Xu ZG, Su KY, Dong SH. Asynchronous parallel disassembly sequence planning for multi-manipulator based on improved shuffled frog leaping algorithm. SN Appl Sci. 2020. https:\/\/doi.org\/10.1007\/s42452-020-2680-9.","journal-title":"SN Appl Sci"},{"key":"3796_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/access.2022.3195863","author":"HE Tseng","year":"2022","unstructured":"Tseng HE, Chang CC, Chung TW. Applying improved particle swarm optimization to asynchronous parallel disassembly planning. IEEE Access. 2022. https:\/\/doi.org\/10.1109\/access.2022.3195863.","journal-title":"IEEE Access"},{"key":"3796_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.01.055","author":"Y Ren","year":"2018","unstructured":"Ren Y, Zhang C, Zhao F, Xiao H, Tian G. An asynchronous parallel disassembly planning based on genetic algorithm. Eur J Oper Res. 2018. https:\/\/doi.org\/10.1016\/j.ejor.2018.01.055.","journal-title":"Eur J Oper Res"},{"key":"3796_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-021-06753-9","author":"Y Xing","year":"2021","unstructured":"Xing Y, Wu D, Qu L. Parallel disassembly sequence planning using improved ant colony algorithm. Int J Adv Manuf Technol. 2021. https:\/\/doi.org\/10.1007\/s00170-021-06753-9.","journal-title":"Int J Adv Manuf Technol"},{"key":"3796_CR21","doi-asserted-by":"publisher","DOI":"10.1115\/1.4037608","author":"F Tao","year":"2017","unstructured":"Tao F, Bi L, Zuo Y, Nee AYC. Partial\/Parallel disassembly sequence planning for complex products. J Manuf Sci Eng. 2017. https:\/\/doi.org\/10.1115\/1.4037608.","journal-title":"J Manuf Sci Eng"},{"key":"3796_CR22","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2017.1342879","author":"HW Kim","year":"2017","unstructured":"Kim HW, Lee DH. An optimal algorithm for selective disassembly sequencing with sequence-dependent set-ups in parallel disassembly environment. Int J Prod Res. 2017. https:\/\/doi.org\/10.1080\/00207543.2017.1342879.","journal-title":"Int J Prod Res"},{"key":"3796_CR23","doi-asserted-by":"publisher","DOI":"10.1080\/09544828.2015.1045841","author":"S Smith","year":"2015","unstructured":"Smith S, Hung PY. A novel selective parallel disassembly planning method for green design. J Eng Des. 2015. https:\/\/doi.org\/10.1080\/09544828.2015.1045841.","journal-title":"J Eng Des"},{"key":"3796_CR24","doi-asserted-by":"publisher","DOI":"10.1177\/09544054211041036","author":"L Zhang","year":"2021","unstructured":"Zhang L, Wu Y, Li Z, Zheng Y, Ren Y, Zhu L. A systematic approach in remanufacturing for high efficiency and low cost: the selective parallel disassembly sequence planning. Proc Inst Mech Eng Part B J Eng Manuf. 2021. https:\/\/doi.org\/10.1177\/09544054211041036.","journal-title":"Proc Inst Mech Eng Part B J Eng Manuf"},{"key":"3796_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-014-5655-4","author":"XF Zhang","year":"2014","unstructured":"Zhang XF, Yu G, Hu ZY, Pei CH, Ma GQ. Parallel disassembly sequence planning for complex products based on fuzzy-rough sets. Int J Adv Manuf Technol. 2014. https:\/\/doi.org\/10.1007\/s00170-014-5655-4.","journal-title":"Int J Adv Manuf Technol"},{"key":"3796_CR26","doi-asserted-by":"publisher","DOI":"10.1109\/tii.2019.2904631","author":"F Pistolesi","year":"2019","unstructured":"Pistolesi F, Lazzerini B. TeMA: A Tensorial Memetic Algorithm for many-objective parallel disassembly sequence planning in product refurbishment. IEEE Trans Industr Inf. 2019. https:\/\/doi.org\/10.1109\/tii.2019.2904631.","journal-title":"IEEE Trans Industr Inf"},{"key":"3796_CR27","volume-title":"Reinforcement learning","author":"RS Sutton","year":"2018","unstructured":"Sutton RS, Barto AG. Reinforcement learning. Cambridge: MIT Press; 2018."},{"key":"3796_CR28","doi-asserted-by":"crossref","unstructured":"Brittain M, Wei P. Autonomous aircraft sequencing and separation using hierarchical deep reinforcement learning. In: Proceedings of the 8th international conference on research in air transportation. Spain. 2018.","DOI":"10.2514\/6.2018-3664"},{"key":"3796_CR29","doi-asserted-by":"publisher","unstructured":"Belmamoune MA, Ghomri L, Yahouni Z. Solving a job shop scheduling problem using q-learning algorithm. service oriented, holonic and multi-agent manufacturing systems for industry of the future. In: Studies in computational Intelligence. 2023; https:\/\/doi.org\/10.1007\/978-3-031-24291-5_16.","DOI":"10.1007\/978-3-031-24291-5_16"},{"key":"3796_CR30","unstructured":"Watkins C. Learning from delayed rewards. PhD Thesis, Cambridge University. UK. 1989."},{"key":"3796_CR31","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, et al. Human-level control through deep reinforcement learning. Nature. 2015. https:\/\/doi.org\/10.1038\/nature14236.","journal-title":"Nature"},{"key":"3796_CR32","doi-asserted-by":"publisher","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller MA. Playing atari with deep reinforcement learning. ArXiv. 2013; https:\/\/doi.org\/10.48550\/arXiv.1312.5602","DOI":"10.48550\/arXiv.1312.5602"},{"key":"3796_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-022-10639-9","author":"X Zhu","year":"2023","unstructured":"Zhu X, Zhigang Xu, Wang J, Yang X, Fan L. Graph-based assembly sequence planning algorithm with feedback weights. Int J Adv Manuf Technol. 2023. https:\/\/doi.org\/10.1007\/s00170-022-10639-9.","journal-title":"Int J Adv Manuf Technol"},{"key":"3796_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2020.10.014","author":"H-E Tseng","year":"2020","unstructured":"Tseng H-E, Huang Y-M, Chang C-C, Lee S-C. Disassembly sequence planning using a Flatworm algorithm. J Manuf Syst. 2020. https:\/\/doi.org\/10.1016\/j.jmsy.2020.10.014.","journal-title":"J Manuf Syst"},{"key":"3796_CR35","unstructured":"Hasselt HV, Guez A, Silver D. Deep reinforcement learning with double Q-learning. In: AAAI conference on artificial intelligence. 2015."},{"key":"3796_CR36","unstructured":"Wang Z, Schaul T, Hessel M, Hasselt HV, Lanctot M, de Freitas N. Dueling network architectures for deep reinforcement learning. In: International conference on machine learning. 2015."},{"key":"3796_CR37","unstructured":"Agarap AF. Deep learning using rectified linear units (ReLU).\u00a0ArXiv. 2018. arXiv:1803.08375."},{"key":"3796_CR38","unstructured":"Kingma DP, Ba J Adam. A method for stochastic optimization. CoRR. 2014. arXiv:abs\/1412.6980."},{"key":"3796_CR39","doi-asserted-by":"publisher","DOI":"10.2307\/1910129","author":"AH Land","year":"1960","unstructured":"Land AH, Doig AG. An automatic method of solving discrete programming problems. Econometrica. 1960. https:\/\/doi.org\/10.2307\/1910129.","journal-title":"Econometrica"},{"key":"3796_CR40","doi-asserted-by":"crossref","unstructured":"John DC Little, Murty KG, Sweeney DW, Karel C. An algorithm for the traveling salesman problem. Oper Res. 1963;11(6):972\u2013989. http:\/\/www.jstor.org\/stable\/167836","DOI":"10.1287\/opre.11.6.972"},{"key":"3796_CR41","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput. 1997. https:\/\/doi.org\/10.1109\/4235.585892.","journal-title":"IEEE Trans Evol Comput"},{"key":"3796_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jjimei.2022.100111","author":"MA Walid","year":"2022","unstructured":"Walid MA, Ahmed SM, Mohammad Z, Galib SM, Nesa M. Analysis of machine learning strategies for prediction of passing undergraduate admission test. Int J Inf Manag Data Insights. 2022. https:\/\/doi.org\/10.1016\/j.jjimei.2022.100111.","journal-title":"Int J Inf Manag Data Insights"},{"key":"3796_CR43","doi-asserted-by":"publisher","unstructured":"Walid MA, Ahmed SM, Sadique SMS. A comparative analysis of machine learning models for prediction of passing bachelor admission test in life-science Faculty of a Public University in Bangladesh. In: IEEE electric power and energy conference. 2020; https:\/\/doi.org\/10.1109\/EPEC48502.2020.9320119.","DOI":"10.1109\/EPEC48502.2020.9320119"},{"key":"3796_CR44","doi-asserted-by":"publisher","unstructured":"Chowdhury MIH, Sakib NM, Ahmed SM, Zeyad M, Walid MAA, Kawcher G. Human face detection and recognition protection system based on machine learning algorithms with proposed AR technology. In: Verma JK, Paul S, editors. Advances in augmented reality and virtual reality. Studies in computational intelligence. 2022. https:\/\/doi.org\/10.1007\/978-981-16-7220-0_11","DOI":"10.1007\/978-981-16-7220-0_11"},{"key":"3796_CR45","doi-asserted-by":"publisher","unstructured":"Anubhove MST, Ahmed SM, Zeyad M, Walid MA, Ashrafi N, Saleque AM. Tomato\u2019s disease identification using machine learning techniques with the potential of AR and VR technologies for inclusiveness. In: Verma JK, Paul S, editors. Advances in augmented reality and virtual reality. Studies in computational intelligence. 2022. https:\/\/doi.org\/10.1007\/978-981-16-7220-0_7","DOI":"10.1007\/978-981-16-7220-0_7"},{"key":"3796_CR46","doi-asserted-by":"publisher","unstructured":"Zim AH, Zeyad M, Ahmed SMM, Hossain E. Short-term weather forecasting for wind energy generation using a deep learning technique. In: International conference on smart systems and technologies. 2022; https:\/\/doi.org\/10.1109\/SST55530.2022.9954683.","DOI":"10.1109\/SST55530.2022.9954683"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03796-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-03796-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03796-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T09:58:56Z","timestamp":1741600736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-03796-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":46,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["3796"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-03796-7","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"27 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All the authors have approved the final version of the manuscript.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"265"}}