{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:57:52Z","timestamp":1780491472049,"version":"3.54.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:00:00Z","timestamp":1627344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:00:00Z","timestamp":1627344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11227-021-03998-9","type":"journal-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T14:02:55Z","timestamp":1627394575000},"page":"3517-3538","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9442-440X","authenticated-orcid":false,"given":"Noor Aldeen","family":"Alawad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bilal H.","family":"Abed-alguni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,27]]},"reference":[{"issue":"15","key":"3998_CR1","doi-asserted-by":"crossref","first-page":"4297","DOI":"10.1007\/s00500-016-2062-9","volume":"21","author":"H Wang","year":"2017","unstructured":"Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297\u20134307","journal-title":"Soft Comput"},{"issue":"5","key":"3998_CR2","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TCYB.2018.2817240","volume":"49","author":"K Gao","year":"2018","unstructured":"Gao K, Yang F, Zhou M, Pan Q, Suganthan PN (2018) Flexible job-shop rescheduling for new job insertion by using discrete jaya algorithm. IEEE Trans Cybern 49(5):1944\u20131955","journal-title":"IEEE Trans Cybern"},{"key":"3998_CR3","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.engappai.2017.07.023","volume":"65","author":"F Zhao","year":"2017","unstructured":"Zhao F, Liu Y, Zhang Y, Ma W, Zhang C (2017) A hybrid harmony search algorithm with efficient job sequence scheme and variable neighborhood search for the permutation flow shop scheduling problems. Eng Appl Artif Intell 65:178\u2013199","journal-title":"Eng Appl Artif Intell"},{"key":"3998_CR4","unstructured":"Mumtaz J, Zailin G, Mirza J, Rauf M, Sarfraz S, Shehab E (2018) Makespan minimization for flow shop scheduling problems using modified operators in genetic algorithm. In: Advances in Manufacturing Technology XXXII: Proceedings of the 16th International Conference on Manufacturing Research, incorporating the 33rd National Conference on Manufacturing Research, September 11\u201313, 2018, University of Sk\u00f6vde, Sweden. 8: 435. IOS Press"},{"issue":"3","key":"3998_CR5","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1016\/j.ejor.2019.10.017","volume":"282","author":"V Fernandez-Viagas","year":"2020","unstructured":"Fernandez-Viagas V, Molina-Pariente JM, Framinan JM (2020) Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur J Oper Res 282(3):858\u2013872","journal-title":"Eur J Oper Res"},{"key":"3998_CR6","doi-asserted-by":"crossref","first-page":"106458","DOI":"10.1016\/j.asoc.2020.106458","volume":"94","author":"M Kurdi","year":"2020","unstructured":"Kurdi M (2020) A memetic algorithm with novel semi-constructive evolution operators for permutation flowshop scheduling problem. Appl Soft Comput 94:106458","journal-title":"Appl Soft Comput"},{"key":"3998_CR7","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness: Wh free.Co., San Fr. 90(1)"},{"issue":"3","key":"3998_CR8","first-page":"415","volume":"11","author":"A Mishra","year":"2020","unstructured":"Mishra A, Shrivastava D (2020) A discrete jaya algorithm for permutation flow-shop scheduling problem. Int J Ind Eng Comput 11(3):415\u2013428","journal-title":"Int J Ind Eng Comput"},{"key":"3998_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.future.2018.03.020","volume":"85","author":"M Abdel-Basset","year":"2018","unstructured":"Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Fut Gener Comput Syst 85:129\u2013145","journal-title":"Fut Gener Comput Syst"},{"issue":"2","key":"3998_CR10","first-page":"159","volume":"32","author":"BH Abed-alguni","year":"2020","unstructured":"Abed-alguni BH, Alkhateeb F (2020) Intelligent hybrid cuckoo search and $$\\beta $$-hill climbing algorithm. J King Saud Univ Comput Inf Sci 32(2):159\u2013173","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"8","key":"3998_CR11","doi-asserted-by":"crossref","first-page":"3635","DOI":"10.1007\/s13369-017-2663-3","volume":"42","author":"BH Abed-alguni","year":"2017","unstructured":"Abed-alguni BH, Alkhateeb F (2017) Novel selection schemes for cuckoo search. Arab J Sci Eng 42(8):3635\u20133654","journal-title":"Arab J Sci Eng"},{"key":"3998_CR12","first-page":"319","volume":"11","author":"BH Abed-alguni","year":"2019","unstructured":"Abed-alguni BH, Klaib AF, Nahar KM (2019) Island-based whale optimization algorithm for continuous optimization problems. Int J Reason Based Intell Syst 11:319","journal-title":"Int J Reason Based Intell Syst"},{"issue":"2","key":"3998_CR13","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.cie.2012.03.015","volume":"63","author":"F Ahmadizar","year":"2012","unstructured":"Ahmadizar F (2012) A new ant colony algorithm for makespan minimization in permutation flow shops. Comput Ind Eng 63(2):355\u2013361","journal-title":"Comput Ind Eng"},{"key":"3998_CR14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.asoc.2014.12.011","volume":"29","author":"CL Chen","year":"2015","unstructured":"Chen CL, Tzeng YR, Chen CL (2015) A new heuristic based on local best solution for permutation flow shop scheduling. Appl Soft Comput 29:75\u201381","journal-title":"Appl Soft Comput"},{"issue":"1","key":"3998_CR15","first-page":"19","volume":"7","author":"R Rao","year":"2016","unstructured":"Rao R (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19\u201334","journal-title":"Int J Ind Eng Comput"},{"key":"3998_CR16","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.energy.2017.04.059","volume":"128","author":"RV Rao","year":"2017","unstructured":"Rao RV, Saroj A (2017) Constrained economic optimization of shell-and-tube heat exchangers using elitist-jaya algorithm. Energy 128:785\u2013800","journal-title":"Energy"},{"key":"3998_CR17","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.ref.2019.04.001","volume":"30","author":"U Raut","year":"2019","unstructured":"Raut U, Mishra S (2019) An improved elitist-jaya algorithm for simultaneous network reconfiguration and dg allocation in power distribution systems. Renewable Energy Focus 30:92\u2013106","journal-title":"Renewable Energy Focus"},{"issue":"12","key":"3998_CR18","doi-asserted-by":"crossref","first-page":"4383","DOI":"10.1007\/s00500-018-3095-z","volume":"23","author":"RV Rao","year":"2019","unstructured":"Rao RV, Saroj A (2019) An elitism-based self-adaptive multi-population jaya algorithm and its applications. Soft Comput 23(12):4383\u20134406","journal-title":"Soft Comput"},{"issue":"3","key":"3998_CR19","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1007\/s11227-019-02759-z","volume":"75","author":"H Migall\u00f3n","year":"2019","unstructured":"Migall\u00f3n H, Jimeno-Morenilla A, S\u00e1nchez-Romero J, Rico H, Rao RV (2019) Multipopulation-based multi-level parallel enhanced jaya algorithms. J Supercomput 75(3):1697\u20131716","journal-title":"J Supercomput"},{"issue":"3","key":"3998_CR20","doi-asserted-by":"crossref","first-page":"1094","DOI":"10.1007\/s11227-018-2316-7","volume":"75","author":"A Jimeno-Morenilla","year":"2019","unstructured":"Jimeno-Morenilla A, S\u00e1nchez-Romero J-L, Migall\u00f3n H, Mora-Mora H (2019) Jaya optimization algorithm with gpu acceleration. J Supercomput 75(3):1094\u20131106","journal-title":"J Supercomput"},{"key":"3998_CR21","doi-asserted-by":"crossref","first-page":"105626","DOI":"10.1016\/j.asoc.2019.105626","volume":"83","author":"DR Nayak","year":"2019","unstructured":"Nayak DR, Zhang Y, Das DS, Panda S (2019) Mjaya-elm: A jaya algorithm with mutation and extreme learning machine based approach for sensorineural hearing loss detection. Appl Soft Comput 83:105626","journal-title":"Appl Soft Comput"},{"issue":"3","key":"3998_CR22","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1016\/j.ejor.2006.06.042","volume":"185","author":"K Deb","year":"2008","unstructured":"Deb K, Tiwari S (2008) Omni-optimizer: a generic evolutionary algorithm for single and multi-objective optimization. Eur J Oper Res 185(3):1062\u20131087","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3998_CR23","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"key":"3998_CR24","doi-asserted-by":"crossref","unstructured":"Yang X-S, Deb Suash (2009) Cuckoo search via l\u00e9vy flights. In World Congress on Nature & Biologically Inspired Computing. NaBIC 2009., pp 210\u2013214","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"3998_CR25","doi-asserted-by":"crossref","unstructured":"Tasgetiren F, Chen A, Gencyilmaz G, Gattoufi Said (2009) Smallest position value approach. In: Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. pp 121\u2013138. Springer","DOI":"10.1007\/978-3-540-92151-6_5"},{"key":"3998_CR26","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1515\/jisys-2017-0268","volume":"28","author":"F Alkhateeb","year":"2019","unstructured":"Alkhateeb F, Abed-Alguni BH (2019) A hybrid cuckoo search and simulated annealing algorithm. J Intell Syst 28:683","journal-title":"J Intell Syst"},{"issue":"0","key":"3998_CR27","first-page":"1","volume":"0","author":"BH Abed-alguni","year":"2018","unstructured":"Abed-alguni BH, Klaib AF (2018) Hybrid whale optimisation and $$\\beta $$-hill climbing algorithm. Int J Comput Sci Math 0(0):1\u201313","journal-title":"Int J Comput Sci Math"},{"key":"3998_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-05939-3","author":"BH Abed-alguni","year":"2021","unstructured":"Abed-alguni BH, Alawad NA, Barhoush M, Hammad Rafat (2021) Exploratory cuckoo search for solving single-objective optimization problems. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-021-05939-3","journal-title":"Soft Comput"},{"issue":"1","key":"3998_CR29","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1515\/jisys-2018-0331","volume":"29","author":"BH Abed-Alguni","year":"2018","unstructured":"Abed-Alguni BH, Paul DJ (2018) Hybridizing the cuckoo search algorithm with different mutation operators for numerical optimization problems. J Intell Syst 29(1):1043\u20131062","journal-title":"J Intell Syst"},{"issue":"3","key":"3998_CR30","first-page":"1","volume":"9","author":"K Deb","year":"1994","unstructured":"Deb K, Agrawal RB (1994) Simulated binary crossover for continuous search space. Complex Syst 9(3):1\u201315","journal-title":"Complex Syst"},{"key":"3998_CR31","doi-asserted-by":"crossref","first-page":"3213","DOI":"10.1007\/s13369-020-05141-x","volume":"46","author":"NA Alawad","year":"2020","unstructured":"Alawad NA, Abed-alguni BH (2020) Discrete island-based cuckoo search with highly disruptive polynomial mutation and opposition-based learning strategy for scheduling of workflow applications in cloud environments. Arab J Sci Eng 46:3213","journal-title":"Arab J Sci Eng"},{"key":"3998_CR32","doi-asserted-by":"crossref","first-page":"107113","DOI":"10.1016\/j.asoc.2021.107113","volume":"102","author":"BH Abed-alguni","year":"2021","unstructured":"Abed-alguni BH, Alawad NA (2021) Distributed grey wolf optimizer for scheduling of workflow applications in cloud environment. Appl Soft Comput J 102:107113","journal-title":"Appl Soft Comput J"},{"key":"3998_CR33","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","volume":"36","author":"J Lin","year":"2017","unstructured":"Lin J, Wang ZJ, Li X (2017) A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol Comput 36:124\u2013135","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"3998_CR34","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):65\u201374","journal-title":"Eur J Oper Res"},{"key":"3998_CR35","unstructured":"St\u00fctzle T (1998) Applying iterated local search to the permutation flow shop problem"},{"issue":"21","key":"3998_CR36","doi-asserted-by":"crossref","first-page":"7436","DOI":"10.1016\/j.eswa.2015.05.035","volume":"42","author":"F Zhao","year":"2015","unstructured":"Zhao F, Liu Y, Zhang C, Wang J (2015) A self-adaptive harmony pso search algorithm and its performance analysis. Expert Syst Appl 42(21):7436\u20137455","journal-title":"Expert Syst Appl"},{"issue":"1","key":"3998_CR37","first-page":"57","volume":"17","author":"BH Abed-alguni","year":"2019","unstructured":"Abed-alguni BH (2019) Island-based cuckoo search with highly disruptive polynomial mutation. Int J Artif Intell 17(1):57\u201382","journal-title":"Int J Artif Intell"},{"issue":"5","key":"3998_CR38","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/JPROC.2002.1015001","volume":"90","author":"G Setti","year":"2002","unstructured":"Setti G, Mazzini G, Rovatti R, Callegari S (2002) Statistical modeling of discrete-time chaotic processes-basic finite-dimensional tools and applications. Proc IEEE 90(5):662\u2013690","journal-title":"Proc IEEE"},{"key":"3998_CR39","doi-asserted-by":"crossref","first-page":"106064","DOI":"10.1016\/j.cie.2019.106064","volume":"137","author":"RH Caldeira","year":"2019","unstructured":"Caldeira RH, Gnanavelbabu A (2019) Solving the flexible job shop scheduling problem using an improved jaya algorithm. Comput Ind Eng 137:106064","journal-title":"Comput Ind Eng"},{"issue":"4","key":"3998_CR40","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1504\/IJBIC.2012.048061","volume":"4","author":"MK Marichelvam","year":"2012","unstructured":"Marichelvam MK (2012) An improved hybrid cuckoo search (ihcs) metaheuristics algorithm for permutation flow shop scheduling problems. Int J Bio-Inspir Comput 4(4):200\u2013205","journal-title":"Int J Bio-Inspir Comput"},{"issue":"5","key":"3998_CR41","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","volume":"35","author":"Z Lian","year":"2008","unstructured":"Lian Z, Xingsheng G, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solitons Fract 35(5):851\u2013861","journal-title":"Chaos Solitons Fract"},{"issue":"1","key":"3998_CR42","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3\u201318","journal-title":"Swarm Evolut Comput"},{"issue":"1","key":"3998_CR43","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1214\/aoms\/1177731944","volume":"11","author":"M Friedman","year":"1940","unstructured":"Friedman M (1940) A comparison of alternative tests of significance for the problem of m rankings. Ann Math Stat 11(1):86\u201392","journal-title":"Ann Math Stat"},{"issue":"10","key":"3998_CR44","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda S, Fern\u00e1ndez A, Luengo J, Herrera F (2010) Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power. Inf Sci 180(10):2044\u20132064","journal-title":"Inf Sci"},{"issue":"1\u20132","key":"3998_CR45","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/biomet\/52.1-2.203","volume":"52","author":"EA Gehan","year":"1965","unstructured":"Gehan EA (1965) A generalized wilcoxon test for comparing arbitrarily singly-censored samples. Biometrika 52(1\u20132):203\u2013224","journal-title":"Biometrika"},{"issue":"7","key":"3998_CR46","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1016\/j.cor.2011.08.016","volume":"39","author":"S-H Chen","year":"2012","unstructured":"Chen S-H, Chang P-C, Cheng TCE, Zhang Q (2012) A self-guided genetic algorithm for permutation flowshop scheduling problems. Comput Oper Res 39(7):1450\u20131457","journal-title":"Comput Oper Res"},{"issue":"1","key":"3998_CR47","first-page":"71","volume":"14","author":"BH Abed-Alguni","year":"2016","unstructured":"Abed-Alguni BH, Paul DJ, Chalup SK, Henskens FA (2016) A comparison study of cooperative Q-learning algorithms for independent learners. Int J Artif Intell TM 14(1):71\u201393","journal-title":"Int J Artif Intell TM"},{"issue":"4","key":"3998_CR48","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s40595-015-0045-x","volume":"2","author":"BH Abed-alguni","year":"2015","unstructured":"Abed-alguni BH, Chalup SK, Henskens FA, Paul DJ (2015) A multi-agent cooperative reinforcement learning model using a hierarchy of consultants, tutors and workers. Vietnam J Comput Sci 2(4):213\u2013226","journal-title":"Vietnam J Comput Sci"},{"issue":"4","key":"3998_CR49","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s40595-015-0047-8","volume":"2","author":"BH Abed-alguni","year":"2015","unstructured":"Abed-alguni BH, Chalup SK, Henskens FA, Paul DJ (2015) Erratum to: A multi-agent cooperative reinforcement learning model using a hierarchy of consultants, tutors and workers. Vietnam J Comput Sci 2(4):227\u2013227","journal-title":"Vietnam J Comput Sci"},{"issue":"2","key":"3998_CR50","first-page":"41","volume":"16","author":"BH Abed-alguni","year":"2018","unstructured":"Abed-alguni BH, Ottom MA (2018) Double delayed Q-learning. Int J Artif Intell TM 16(2):41\u201359","journal-title":"Int J Artif Intell TM"},{"key":"3998_CR51","unstructured":"Abed-Alguni BHK (2014) Cooperative reinforcement learning for independent learners. PhD thesis, Faculty of Engineering and Built Environment, School of Electrical Engineering and Computer Science, The University of Newcastle, Australia"},{"issue":"1","key":"3998_CR52","first-page":"56","volume":"3","author":"BH Abed-alguni","year":"2017","unstructured":"Abed-alguni BH (2017) Bat Q-learning algorithm. Jordan J Comput Inf Technol 3(1):56\u201377","journal-title":"Jordan J Comput Inf Technol"},{"issue":"12","key":"3998_CR53","doi-asserted-by":"crossref","first-page":"6771","DOI":"10.1007\/s13369-017-2873-8","volume":"43","author":"BH Abed-alguni","year":"2018","unstructured":"Abed-alguni BH (2018) Action-selection method for reinforcement learning based on cuckoo search algorithm. Arab J Sci Eng 43(12):6771\u20136785","journal-title":"Arab J Sci Eng"},{"key":"3998_CR54","unstructured":"Abed-alguni BH, Barhoush M (2018) Distributed grey wolf optimizer for numerical optimization problems. Jordan J Comput Inf Technol 4(03)"},{"key":"3998_CR55","doi-asserted-by":"crossref","unstructured":"Alawad NA, Anagnostopoulos A, Leonardi S, Mele I, Silvestri (2016) Network-aware recommendations of novel tweets. In: Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval. pp 913\u2013916. ACM","DOI":"10.1145\/2911451.2914760"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03998-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03998-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03998-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T13:18:41Z","timestamp":1644239921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03998-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,27]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["3998"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03998-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,27]]},"assertion":[{"value":"12 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}