{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T05:52:28Z","timestamp":1776750748737,"version":"3.51.2"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:00:00Z","timestamp":1716768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:00:00Z","timestamp":1716768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62173216"],"award-info":[{"award-number":["62173216"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The resource-assisted processing operation involves the coupling of multi-dimensional sub-problem, which poses a challenge in scheduling system. In this study, a dimension-aware gain-sharing knowledge algorithm (DGSK) is presented to address the distributed hybrid flowshop scheduling problem with resource-dependent processing times (DHFSP-RDPT), where the makespan is to be minimized. Firstly, by analyzing the mathematical model of the DHFSP-RDPT, four problem-specific lemmas and two novel resource reallocation rules are proposed. The DGSK begin with a high-performance initial population, which is generated by three knowledge-driven heuristics in hybrid way. Next, a discrete evolution-based search mechanism assists the DGSK to extend the search in solution space. Furthermore, a dimension-aware two-stage local search combined with meta-Lamarckian learning method is embedded to enhance the local search ability for the multidimensional problems. Finally, the proposed algorithm is measured on a series of instances based on real production data. The results demonstrate that the DGSK improves the performance by in solving DHFSP-RDPT compared to the state-of-the-art methods.<\/jats:p>","DOI":"10.1007\/s40747-024-01484-2","type":"journal-article","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T07:02:20Z","timestamp":1716793340000},"page":"6051-6080","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A dimension-aware gaining-sharing knowledge algorithm for distributed hybrid flowshop scheduling with resource-dependent processing time"],"prefix":"10.1007","volume":"10","author":[{"given":"Rong-hao","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3617-6708","authenticated-orcid":false,"given":"Jun-qing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jia-ke","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Ouyang","sequence":"additional","affiliation":[]},{"given":"Li-jie","family":"Mei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,27]]},"reference":[{"issue":"2","key":"1484_CR1","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/TASE.2015.2425404","volume":"13","author":"JQ Li","year":"2016","unstructured":"Li JQ, Pan QK, Mao K (2016) A hybrid fruit fly optimization algorithm for the realistic hybrid flowshop rescheduling problem in steelmaking systems. IEEE T Autom Sci Eng 13(2):932\u2013949","journal-title":"IEEE T Autom Sci Eng"},{"issue":"20","key":"1484_CR2","doi-asserted-by":"crossref","first-page":"6084","DOI":"10.1080\/00207543.2017.1324222","volume":"55","author":"M Liu","year":"2017","unstructured":"Liu M, Yang XN, Zhang JT, Chu CB (2017) Scheduling a tempered glass manufacturing system: a three-stage hybrid flow shop model. Int J Prod Res 55(20):6084\u20136107","journal-title":"Int J Prod Res"},{"issue":"4","key":"1484_CR3","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/j.cie.2013.01.004","volume":"64","author":"A Costa","year":"2013","unstructured":"Costa A, Cappadonna FA, Fichera S (2013) A dual encoding-based meta-heuristic algorithm for solving a constrained hybrid flow shop scheduling problem. Comput Ind Eng 64(4):937\u2013958","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1484_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, Vazquez-Rodriguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1\u201318","journal-title":"Eur J Oper Res"},{"key":"1484_CR5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","volume":"92","author":"KC Ying","year":"2018","unstructured":"Ying KC, Lin SW (2018) Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks. Expert Syst Appl 92:132\u2013141","journal-title":"Expert Syst Appl"},{"key":"1484_CR6","doi-asserted-by":"crossref","first-page":"106347","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"LL Meng","year":"2020","unstructured":"Meng LL, Zhang CY, Ren YP, Zhang B, Lv C (2020) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng 142:106347","journal-title":"Comput Ind Eng"},{"issue":"8","key":"1484_CR7","doi-asserted-by":"crossref","first-page":"5318","DOI":"10.1109\/TII.2021.3128405","volume":"18","author":"JQ Li","year":"2022","unstructured":"Li JQ, Chen XL, Duan PY, Mou JH (2022) KMOEA: a knowledge-based multiobjective algorithm for distributed hybrid flow shop in a prefabricated system. IEEE T Ind Inform 18(8):5318\u20135329","journal-title":"IEEE T Ind Inform"},{"key":"1484_CR8","doi-asserted-by":"crossref","first-page":"115453","DOI":"10.1016\/j.eswa.2021.115453","volume":"183","author":"WS Shao","year":"2021","unstructured":"Shao WS, Shao ZS, Pi DC (2021) Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem. Expert Syst Appl 183:115453","journal-title":"Expert Syst Appl"},{"key":"1484_CR9","doi-asserted-by":"crossref","first-page":"105527","DOI":"10.1016\/j.knosys.2020.105527","volume":"194","author":"WS Shao","year":"2020","unstructured":"Shao WS, Shao ZS, Pi DC (2020) Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem. Knowl-Based Syst 194:105527","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"1484_CR10","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.ejor.2004.07.012","volume":"167","author":"RK Kayan","year":"2005","unstructured":"Kayan RK, Akturk MS (2005) A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. Eur J Oper Res 167(3):624\u2013643","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1484_CR11","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ejor.2021.03.034","volume":"296","author":"D Shabtay","year":"2022","unstructured":"Shabtay D (2022) Single-machine scheduling with machine unavailability periods and resource dependent processing times. Eur J Oper Res 296(2):423\u2013439","journal-title":"Eur J Oper Res"},{"issue":"8","key":"1484_CR12","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/S0305-0548(02)00066-7","volume":"30","author":"CTD Ng","year":"2003","unstructured":"Ng CTD, Cheng TCE, Kovalyov MY et al (2003) Single machine scheduling with a variable common due date and resource-dependent processing times. Comput Oper Res 30(8):1173\u20131185","journal-title":"Comput Oper Res"},{"issue":"8","key":"1484_CR13","doi-asserted-by":"crossref","first-page":"5551","DOI":"10.1016\/j.asoc.2011.05.005","volume":"11","author":"K Li","year":"2011","unstructured":"Li K, Shi Y, Yang S et al (2011) Parallel machine scheduling problem to minimize the makespan with resource dependent processing times. Appl Soft Comput 11(8):5551\u20135557","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1484_CR14","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"QK Pan","year":"2012","unstructured":"Pan QK, Wang L, Mao K et al (2012) An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans Autom Sci Eng 10(2):307\u2013322","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"4","key":"1484_CR15","first-page":"289","volume":"23","author":"A Janiak","year":"1987","unstructured":"Janiak A (1987) One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika 23(4):289\u2013293","journal-title":"Kybernetika"},{"issue":"3","key":"1484_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","volume":"69","author":"D Biskup","year":"2001","unstructured":"Biskup D, Jahnke H (2001) Common due date assignment for scheduling on a single machine with jointly reducible processing times. Int J Prod Econ 69(3):317\u2013322","journal-title":"Int J Prod Econ"},{"key":"1484_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","volume":"100","author":"CL Yu","year":"2018","unstructured":"Yu CL, Semeraro Q, Matta A (2018) A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility. Comput Oper Res 100:211\u2013229","journal-title":"Comput Oper Res"},{"issue":"1","key":"1484_CR18","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.cie.2008.04.008","volume":"56","author":"E Figielska","year":"2009","unstructured":"Figielska E (2009) A genetic algorithm and a simulated annealing algorithm combined with column generation technique for solving the problem of scheduling in the hybrid flowshop with additional resources. Comput Ind Eng 56(1):142\u2013151","journal-title":"Comput Ind Eng"},{"key":"1484_CR19","volume":"169","author":"XR Tao","year":"2022","unstructured":"Tao XR, Pan QK, Gao L (2022) An efficient self-adaptive artificial bee colony algorithm for the distributed resource-constrained hybrid flowshop problem. Comput Ind Eng 169:108200","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1484_CR20","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1016\/j.apm.2010.07.057","volume":"35","author":"J Behnamian","year":"2011","unstructured":"Behnamian J, Ghomi SMTF (2011) Hybrid flowshop scheduling with machine and resource-dependent processing times. Appl Math Model 35(3):1107\u20131123","journal-title":"Appl Math Model"},{"issue":"1","key":"1484_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ejor.2022.02.019","volume":"303","author":"A Missaoui","year":"2022","unstructured":"Missaoui A, Ruiz R (2022) A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows. Eur J Oper Res 303(1):99\u2013113","journal-title":"Eur J Oper Res"},{"issue":"5\u20136","key":"1484_CR22","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","volume":"35","author":"K Alayk\u00fdran","year":"2007","unstructured":"Alayk\u00fdran K, Engin O, D\u00f6yen A (2007) Using ant colony optimization to solve hybrid flow shop scheduling problems J. Adv Manuf Technol 35(5\u20136):541\u2013550","journal-title":"Adv Manuf Technol"},{"key":"1484_CR23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.asoc.2014.02.005","volume":"19","author":"MK Marichelvam","year":"2014","unstructured":"Marichelvam MK, Prabaharan T, Yang XS (2014) Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl Soft Comput 19:93\u2013101","journal-title":"Appl Soft Comput"},{"key":"1484_CR24","doi-asserted-by":"crossref","first-page":"115903","DOI":"10.1016\/j.eswa.2021.115903","volume":"187","author":"V Fernandez-Viagas","year":"2022","unstructured":"Fernandez-Viagas V (2022) A speed-up procedure for the hybrid flow shop scheduling problem. Expert Syst Appl 187:115903","journal-title":"Expert Syst Appl"},{"issue":"6","key":"1484_CR25","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s10845-009-0373-8","volume":"22","author":"HS Mirsanei","year":"2010","unstructured":"Mirsanei HS, Zandieh M, Moayed MJ, Khabbazi MR (2010) A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times. J Intell Manuf 22(6):965\u2013978","journal-title":"J Intell Manuf"},{"issue":"9","key":"1484_CR26","doi-asserted-by":"crossref","first-page":"10787","DOI":"10.1016\/j.eswa.2011.01.173","volume":"38","author":"F Choong","year":"2011","unstructured":"Choong F, Phon-Amnuaisuk S, Alias MY (2011) Metaheuristic methods in hybrid flow shop scheduling problem. Expert Syst Appl 38(9):10787\u201310793","journal-title":"Expert Syst Appl"},{"key":"1484_CR27","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","volume":"316","author":"JQ Li","year":"2015","unstructured":"Li JQ, Pan QK (2015) Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm. Inform Sci 316:487\u2013502","journal-title":"Inform Sci"},{"issue":"8","key":"1484_CR28","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1007\/s10845-015-1078-9","volume":"28","author":"C Chamnanlor","year":"2015","unstructured":"Chamnanlor C, Sethanan K, Gen M, Chien C-F (2015) Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. J Intell Manuf 28(8):1915\u20131931","journal-title":"J Intell Manuf"},{"key":"1484_CR29","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s00170-009-2475-z","volume":"49","author":"E Rashidi","year":"2010","unstructured":"Rashidi E, Jahandar M, Zandieh M (2010) An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int J Adv Manuf Technol 49:1129\u20131139","journal-title":"Int J Adv Manuf Technol"},{"key":"1484_CR30","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106545","volume":"146","author":"A Costa","year":"2020","unstructured":"Costa A, Fernandez-Viagas V, Framinan JM (2020) Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput Ind Eng 146:106545","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1484_CR31","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.cor.2011.02.017","volume":"39","author":"C Gicquel","year":"2012","unstructured":"Gicquel C, Hege L, Minoux M, van Canneyt W (2012) A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Comput Oper Res 39(3):629\u2013636","journal-title":"Comput Oper Res"},{"key":"1484_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3300922","author":"J Li","year":"2023","unstructured":"Li J, Han Y, Gao K et al (2023) Bi-population balancing multi-objective algorithm for fuzzy flexible job shop with energy and transportation. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/TASE.2023.3300922","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1484_CR33","volume":"90","author":"JC Cai","year":"2020","unstructured":"Cai JC, Zhou R, Lei DM (2020) Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks. Eng Appl Artif Intel 90:103540","journal-title":"Eng Appl Artif Intel"},{"issue":"6","key":"1484_CR34","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1109\/TETCI.2020.3022372","volume":"5","author":"JJ Wang","year":"2021","unstructured":"Wang JJ, Wang L (2021) A bi-population cooperative memetic algorithm for distributed hybrid flow-shop scheduling. IEEE Trans Emerg Top Comput Intell 5(6):947\u2013961","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"key":"1484_CR35","volume":"268","author":"Y Du","year":"2024","unstructured":"Du Y, Li J (2024) A deep reinforcement learning based algorithm for a distributed precast concrete production scheduling. Int J Prod Econ 268:109102","journal-title":"Int J Prod Econ"},{"issue":"4","key":"1484_CR36","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1007\/s40815-021-01050-9","volume":"23","author":"JQ Li","year":"2021","unstructured":"Li JQ, Li JK, Zhang LJ, Sang HY, Han YY, Chen QD (2021) Solving type-2 fuzzy distributed hybrid flowshop scheduling using an improved brainstorm optimization algorithm. Int J Fuzzy Syst 23(4):1194\u20131212","journal-title":"Int J Fuzzy Syst"},{"issue":"9","key":"1484_CR37","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1080\/0305215X.2019.1674295","volume":"52","author":"DM Lei","year":"2020","unstructured":"Lei DM, Wang T (2020) Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping. Eng Optimiz 52(9):1461\u20131474","journal-title":"Eng Optimiz"},{"key":"1484_CR38","doi-asserted-by":"crossref","first-page":"105536","DOI":"10.1016\/j.knosys.2020.105536","volume":"194","author":"J Zheng","year":"2020","unstructured":"Zheng J, Wang L, Wang JJ (2020) A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop. Knowl-Based Syst 194:105536","journal-title":"Knowl-Based Syst"},{"key":"1484_CR39","doi-asserted-by":"crossref","first-page":"117555","DOI":"10.1016\/j.eswa.2022.117555","volume":"204","author":"C Lu","year":"2022","unstructured":"Lu C, Liu Q, Zhang B, Yin L (2022) A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop. Expert Syst Appl 204:117555","journal-title":"Expert Syst Appl"},{"issue":"3","key":"1484_CR40","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1109\/TASE.2021.3062979","volume":"19","author":"JQ Li","year":"2022","unstructured":"Li JQ, Du Y, Gao KZ et al (2022) A hybrid iterated greedy algorithm for a crane transportation flexible job shop problem. IEEE Trans Autom Sci Eng 19(3):2153\u20132170","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"2","key":"1484_CR41","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/j.ejor.2013.12.003","volume":"236","author":"E Figielska","year":"2014","unstructured":"Figielska E (2014) A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages. Eur J Oper Res 236(2):433\u2013444","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1484_CR42","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1016\/j.apm.2011.07.005","volume":"36","author":"CM Wei","year":"2012","unstructured":"Wei CM, Wang JB, Ji P (2012) Single-machine scheduling with time-and-resource-dependent processing times. Appl Math Model 36(2):792\u2013798","journal-title":"Appl Math Model"},{"key":"1484_CR43","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.cie.2014.06.017","volume":"75","author":"YL Liu","year":"2014","unstructured":"Liu YL, Feng ZR (2014) Two-machine no-wait flowshop scheduling with learning effect and convex resource-dependent processing times. Comput Ind Eng 75:170\u2013175","journal-title":"Comput Ind Eng"},{"issue":"19\u201320","key":"1484_CR44","doi-asserted-by":"crossref","first-page":"4747","DOI":"10.1016\/j.apm.2014.03.022","volume":"38","author":"N Yin","year":"2014","unstructured":"Yin N, Kang LY, Sun TC, Yue C, Wang XR (2014) Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times. Appl Math Model 38(19\u201320):4747\u20134755","journal-title":"Appl Math Model"},{"key":"1484_CR45","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.cie.2015.06.002","volume":"87","author":"SL Jiang","year":"2015","unstructured":"Jiang SL, Liu M, Hao JH, Qian WP (2015) A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry. Comput Ind Eng 87:518\u2013531","journal-title":"Comput Ind Eng"},{"issue":"2","key":"1484_CR46","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.ijpe.2008.10.014","volume":"117","author":"LH Su","year":"2009","unstructured":"Su LH, Lien CY (2009) Scheduling parallel machines with resource-dependent processing times. Int J Prod Econ 117(2):256\u2013266","journal-title":"Int J Prod Econ"},{"issue":"19","key":"1484_CR47","doi-asserted-by":"crossref","first-page":"5851","DOI":"10.1080\/00207543.2010.523724","volume":"49","author":"H Mokhtari","year":"2011","unstructured":"Mokhtari H, Abadi INK, Cheraghalikhani A (2011) A multi-objective flow shop scheduling with resource-dependent processing times: trade-off between makespan and cost of resources. Int J Prod Res 49(19):5851\u20135875","journal-title":"Int J Prod Res"},{"key":"1484_CR48","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.measurement.2016.06.050","volume":"93","author":"A Ebrahimnejad","year":"2016","unstructured":"Ebrahimnejad A, Tavana M, Alrezaamiri H (2016) A novel artificial bee colony algorithm for shortest path problems with fuzzy arc weights. Measurement 93:48\u201356","journal-title":"Measurement"},{"issue":"2","key":"1484_CR49","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/coin.12258","volume":"36","author":"A Abbaszadeh Sori","year":"2020","unstructured":"Abbaszadeh Sori A, Ebrahimnejad A, Motameni H (2020) Elite artificial bees\u2019 colony algorithm to solve robot\u2019s fuzzy constrained routing problem. Comput Intell 36(2):659\u2013681","journal-title":"Comput Intell"},{"issue":"20","key":"1484_CR50","doi-asserted-by":"crossref","first-page":"9979","DOI":"10.1007\/s00500-018-3553-7","volume":"23","author":"H Alrezaamiri","year":"2019","unstructured":"Alrezaamiri H, Ebrahimnejad A, Motameni H (2019) Software requirement optimization using a fuzzy artificial chemical reaction optimization algorithm. Soft Comput 23(20):9979\u20139994","journal-title":"Soft Comput"},{"issue":"3","key":"1484_CR51","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s00766-020-00328-y","volume":"25","author":"H Alrezaamiri","year":"2020","unstructured":"Alrezaamiri H, Ebrahimnejad A, Motameni H (2020) Parallel multi-objective artificial bee colony algorithm for software requirement optimization. Requir Eng 25(3):363\u2013380","journal-title":"Requir Eng"},{"issue":"2","key":"1484_CR52","doi-asserted-by":"crossref","first-page":"890","DOI":"10.3906\/elk-1905-177","volume":"28","author":"KR Kalantari","year":"2020","unstructured":"Kalantari KR, Ebrahimnejad A, Motameni H (2020) Dynamic software rejuvenation in web services: a whale optimizationalgorithm-based approach. Turk J Electr Eng Comput Sci 28(2):890\u2013903","journal-title":"Turk J Electr Eng Comput Sci"},{"issue":"4","key":"1484_CR53","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1049\/iet-sen.2019.0018","volume":"14","author":"KR Kalantari","year":"2020","unstructured":"Kalantari KR, Ebrahimnejad A, Motameni H (2020) Efficient improved ant colony optimisation algorithm for dynamic software rejuvenation in web services. IET Softw 14(4):369\u2013376","journal-title":"IET Softw"},{"issue":"3","key":"1484_CR54","doi-asserted-by":"crossref","first-page":"5027","DOI":"10.3233\/JIFS-201759","volume":"40","author":"P Pirozmand","year":"2021","unstructured":"Pirozmand P, Ebrahimnejad A, Alrezaamiri H et al (2021) A novel approach for the next software release using a binary artificial algae algorithm. J Intell Fuzzy Syst 40(3):5027\u20135041","journal-title":"J Intell Fuzzy Syst"},{"issue":"5","key":"1484_CR55","doi-asserted-by":"crossref","first-page":"3403","DOI":"10.1016\/j.aej.2021.08.058","volume":"61","author":"D Di Caprio","year":"2022","unstructured":"Di Caprio D, Ebrahimnejad A, Alrezaamiri H et al (2022) A novel ant colony algorithm for solving shortest path problems with fuzzy arc weights. Alex Eng J 61(5):3403\u20133415","journal-title":"Alex Eng J"},{"key":"1484_CR56","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Wang L, Liang J, Li XY (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1484_CR57","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TEVC.2021.3094542","volume":"26","author":"GH Zhang","year":"2022","unstructured":"Zhang GH, Ma XJ, Wang L, Xing KY (2022) Elite archive-assisted adaptive memetic algorithm for a realistic hybrid differentiation flowshop scheduling problem. IEEE T Evolut Comput 26(1):100\u2013114","journal-title":"IEEE T Evolut Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01484-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01484-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01484-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T15:06:55Z","timestamp":1726326415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01484-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,27]]},"references-count":57,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1484"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01484-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,27]]},"assertion":[{"value":"21 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"To the best of our knowledge, the named authors have no conflict of interest, financial or otherwise.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}