{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:36:16Z","timestamp":1774956976743,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T00:00:00Z","timestamp":1631232000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T00:00:00Z","timestamp":1631232000000},"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,3]]},"DOI":"10.1007\/s11227-021-04050-6","type":"journal-article","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T07:02:57Z","timestamp":1631257377000},"page":"4799-4826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Discrete hybrid cuckoo search and simulated annealing algorithm for solving the job shop scheduling problem"],"prefix":"10.1007","volume":"78","author":[{"given":"Faisal","family":"Alkhateeb","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7481-4854","authenticated-orcid":false,"given":"Bilal H.","family":"Abed-alguni","sequence":"additional","affiliation":[]},{"given":"Mohammad Hani","family":"Al-rousan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"4050_CR1","first-page":"2578","volume":"6","author":"M Yin","year":"2011","unstructured":"Yin M, Li X, Zhou J (2011) An efficient job shop scheduling algorithm based on artificial bee colony. Sci Res Essays 6:2578\u20132596","journal-title":"Sci Res Essays"},{"key":"4050_CR2","first-page":"120","volume":"3","author":"MF Tasgetiren","year":"2006","unstructured":"Tasgetiren MF, Sevkli M, Liang Y-C, Yenisey MM (2006) A particle swarm optimization and differential evolution algorithms for job shop scheduling problem. Int J Oper Res 3:120\u2013135","journal-title":"Int J Oper Res"},{"key":"4050_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-13826-8_7","volume-title":"Recent advances in swarm intelligence and evolutionary computation","author":"A Ouaarab","year":"2015","unstructured":"Ouaarab A, Ahiod B, Yang X-S (2015) Discrete cuckoo search applied to job shop scheduling problem. In: Yang X-S (ed) Recent advances in swarm intelligence and evolutionary computation. Springer, Cham, pp 121\u2013137. https:\/\/doi.org\/10.1007\/978-3-319-13826-8_7"},{"key":"4050_CR4","doi-asserted-by":"publisher","first-page":"26231","DOI":"10.1109\/ACCESS.2018.2833552","volume":"6","author":"T Jiang","year":"2018","unstructured":"Jiang T, Zhang C (2018) Application of grey wolf optimization for solving combinatorial problems: job shop and flexible job shop scheduling cases. IEEE Access 6:26231\u201326240. https:\/\/doi.org\/10.1109\/ACCESS.2018.2833552","journal-title":"IEEE Access"},{"key":"4050_CR5","doi-asserted-by":"publisher","unstructured":"Wang F, Tian Y, Wang X (2019) A discrete wolf pack algorithm for job shop scheduling problem. In: 2019 5th International Conference on Control, Automation and Robotics ICCAR 2019. pp 581\u2013585. https:\/\/doi.org\/10.1109\/ICCAR.2019.8813444","DOI":"10.1109\/ICCAR.2019.8813444"},{"key":"4050_CR6","doi-asserted-by":"publisher","first-page":"310","DOI":"10.37398\/jsr.2020.640157","volume":"64","author":"YR Kalshetty","year":"2020","unstructured":"Kalshetty YR, Adamuthe AC, Kumar SP (2020) Genetic algorithms with feasible operators for solving job shop scheduling problem. J Sci Res 64:310\u2013321. https:\/\/doi.org\/10.37398\/jsr.2020.640157","journal-title":"J Sci Res"},{"key":"4050_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.cie.2016.06.025","volume":"102","author":"L Asadzadeh","year":"2016","unstructured":"Asadzadeh L (2016) A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput Ind Eng 102:359\u2013367. https:\/\/doi.org\/10.1016\/j.cie.2016.06.025","journal-title":"Comput Ind Eng"},{"key":"4050_CR8","unstructured":"Chakraborty S, Bhowmik S (2013) Job shop scheduling using simulated annealing. In: First International Conference on Computation and Communication Advancement. pp 69\u201373"},{"key":"4050_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.procs.2017.08.267","volume":"112","author":"I Chaouch","year":"2017","unstructured":"Chaouch I, Driss OB, Ghedira K (2017) A modified ant colony optimization algorithm for the distributed job shop scheduling problem. Procedia Comput Sci 112:296\u2013305. https:\/\/doi.org\/10.1016\/j.procs.2017.08.267","journal-title":"Procedia Comput Sci"},{"key":"4050_CR10","first-page":"6758","volume":"4","author":"H Zaher","year":"2017","unstructured":"Zaher H, El-sherbieny M (2017) Bat algorithm for job shop scheduling problem. J Multidiscip Eng Sci Technol 4:6758\u20136763","journal-title":"J Multidiscip Eng Sci Technol"},{"key":"4050_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.engappai.2011.08.003","volume":"25","author":"A Banharnsakun","year":"2012","unstructured":"Banharnsakun A, Sirinaovakul B, Achalakul T (2012) Job shop scheduling with the best-so-far ABC. Eng Appl Artif Intell 25:583\u2013593","journal-title":"Eng Appl Artif Intell"},{"key":"4050_CR12","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/j.cie.2015.04.006","volume":"85","author":"L Asadzadeh","year":"2015","unstructured":"Asadzadeh L (2015) A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput Ind Eng 85:376\u2013383. https:\/\/doi.org\/10.1016\/j.cie.2015.04.006","journal-title":"Comput Ind Eng"},{"key":"4050_CR13","unstructured":"Khadwilard A, Pongcharoen P (2013) Job shop scheduling optimisation using harmony search algorithm. Naresuan Univ J Sci Technol pp 8\u201314"},{"key":"4050_CR14","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/310\/1\/012143","author":"K Rameshkumar","year":"2018","unstructured":"Rameshkumar K, Rajendran C (2018) A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan. IOP Conf Ser Mater Sci Eng. https:\/\/doi.org\/10.1088\/1757-899X\/310\/1\/012143","journal-title":"IOP Conf Ser Mater Sci Eng"},{"key":"4050_CR15","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1016\/j.proeng.2014.12.333","volume":"97","author":"KC Udaiyakumar","year":"2014","unstructured":"Udaiyakumar KC, Chandrasekaran M (2014) Application of firefly algorithm in job shop scheduling problem for minimization of makespan. Procedia Eng 97:1798\u20131807. https:\/\/doi.org\/10.1016\/j.proeng.2014.12.333","journal-title":"Procedia Eng"},{"key":"4050_CR16","doi-asserted-by":"publisher","first-page":"4297","DOI":"10.1007\/s00500-016-2062-9","volume":"21","author":"H Wang","year":"2017","unstructured":"Wang H, Wang W, Sun H et al (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21:4297\u20134307. https:\/\/doi.org\/10.1007\/s00500-016-2062-9","journal-title":"Soft Comput"},{"key":"4050_CR17","doi-asserted-by":"publisher","first-page":"3213","DOI":"10.1007\/s13369-020-05141-x","volume":"46","author":"NA Alawad","year":"2021","unstructured":"Alawad NA, Abed-alguni BH (2021) 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\u20133233. https:\/\/doi.org\/10.1007\/s13369-020-05141-x","journal-title":"Arab J Sci Eng"},{"issue":"4","key":"4050_CR18","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1515\/jisys-2017-0268","volume":"28","author":"F Alkhateeb","year":"2017","unstructured":"Alkhateeb F, Abed-Alguni BH (2017) A hybrid cuckoo search and simulated annealing algorithm. Intell Syst 28(4):683\u2013698","journal-title":"Intell Syst"},{"key":"4050_CR19","doi-asserted-by":"crossref","unstructured":"Mousavirad SJ, Rahnamayan S (2020) One-array differential evolution algorithm with a novel replacement strategy for numerical optimization. In: 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, pp 2514\u20132519","DOI":"10.1109\/SMC42975.2020.9283154"},{"key":"4050_CR20","doi-asserted-by":"crossref","unstructured":"Mousavirad SJ, Rahnamayan S (2019) Differential evolution algorithm based on a competition scheme. In: 2019 14th International Conference on Computer Science & Education (ICCSE). IEEE, pp 929\u2013934","DOI":"10.1109\/ICCSE.2019.8845065"},{"key":"4050_CR21","doi-asserted-by":"crossref","unstructured":"Mousavirad SJ, Rahnamayan S (2020) A novel center-based differential evolution algorithm. In: 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185622"},{"key":"4050_CR22","doi-asserted-by":"publisher","DOI":"10.1504\/IJCSM.2020.112650","author":"BH Abed-Alguni","year":"2020","unstructured":"Abed-Alguni BH, Klaib AF (2020) Hybrid whale optimisation and \u03b2-hill climbing algorithm for continuous optimisation problems. Int J Comput Sci Math. https:\/\/doi.org\/10.1504\/IJCSM.2020.112650","journal-title":"Int J Comput Sci Math"},{"key":"4050_CR23","doi-asserted-by":"publisher","first-page":"521","DOI":"10.2507\/ijsimm18(3)co13","volume":"18","author":"J Zhu","year":"2019","unstructured":"Zhu J, Shao ZH, Chen C (2019) An improved whale optimization algorithm for job-shop scheduling based on quantum computing. Int J Simul Model 18:521\u2013530. https:\/\/doi.org\/10.2507\/ijsimm18(3)co13","journal-title":"Int J Simul Model"},{"key":"4050_CR24","doi-asserted-by":"publisher","first-page":"105954","DOI":"10.1016\/j.asoc.2019.105954","volume":"87","author":"M Liu","year":"2020","unstructured":"Liu M, Yao X, Li Y (2020) Hybrid whale optimization algorithm enhanced with L\u00e9vy flight and differential evolution for job shop scheduling problems. Appl Soft Comput J 87:105954. https:\/\/doi.org\/10.1016\/j.asoc.2019.105954","journal-title":"Appl Soft Comput J"},{"key":"4050_CR25","first-page":"319","volume":"11","author":"BH Abed-Alguni","year":"2019","unstructured":"Abed-Alguni BH, Klaib AF, Nahar KMO (2019) Island-based whale optimisation algorithm for continuous optimisation problems. Int J Reason Intell Syst 11:319\u2013329","journal-title":"Int J Reason Intell Syst"},{"key":"4050_CR26","doi-asserted-by":"crossref","unstructured":"Alawad NA, Abed-alguni BH (2021) Discrete Jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J Supercomput pp 1\u201322","DOI":"10.1007\/s11227-021-03998-9"},{"key":"4050_CR27","doi-asserted-by":"publisher","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\u2013698","journal-title":"J Intell Syst"},{"issue":"220","key":"4050_CR28","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"80","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing optimization by simulated annealing. Science 80(220):671\u2013680","journal-title":"Science"},{"key":"4050_CR29","doi-asserted-by":"crossref","unstructured":"Yang XS, Deb S (2009) Cuckoo search via L\u00e9vy flights. In: 2009 World Congress on Nature and Biologically Inspired Computing, NABIC 2009\u2014Proceedings. pp 210\u2013214","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"4050_CR30","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks. IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"4050_CR31","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1108\/02644401211235834","volume":"29","author":"X Yang","year":"2012","unstructured":"Yang X, Gandomi AH (2012) Bat algorithm: a novel approach for global engineering optimization. Eng Comput 29:464\u2013483","journal-title":"Eng Comput"},{"key":"4050_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-017-2663-3","author":"BH Abed-alguni","year":"2017","unstructured":"Abed-alguni BH, Alkhateeb F (2017) Novel selection schemes for cuckoo search. Arab J Sci Eng. https:\/\/doi.org\/10.1007\/s13369-017-2663-3","journal-title":"Arab J Sci Eng"},{"key":"4050_CR33","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"key":"4050_CR34","doi-asserted-by":"publisher","DOI":"10.3390\/app9071353","author":"KW Huang","year":"2019","unstructured":"Huang KW, Girsang AS, Wu ZX, Chuang YW (2019) A hybrid crow search algorithm for solving permutation flow shop scheduling problems. Appl Sci. https:\/\/doi.org\/10.3390\/app9071353","journal-title":"Appl Sci"},{"key":"4050_CR35","unstructured":"Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. Ind Sched pp 225\u2013251"},{"key":"4050_CR36","unstructured":"Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Grad Sch Ind Adm Carnegie-Mellon Univ"},{"key":"4050_CR37","doi-asserted-by":"publisher","first-page":"261","DOI":"10.18488\/journal.2\/2015.5.5\/2.5.261.268","volume":"5","author":"H Nazif","year":"2015","unstructured":"Nazif H (2015) Solving job shop scheduling problem using an ant colony algorithm. J Asian Sci Res 5:261\u2013268. https:\/\/doi.org\/10.18488\/journal.2\/2015.5.5\/2.5.261.268","journal-title":"J Asian Sci Res"},{"key":"4050_CR38","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-81-322-2217-0_9","volume":"335","author":"S Singh","year":"2015","unstructured":"Singh S, Singh KP (2015) Cuckoo search optimization for job shop scheduling problem. Adv Intell Syst Comput 335:99\u2013111. https:\/\/doi.org\/10.1007\/978-81-322-2217-0_9","journal-title":"Adv Intell Syst Comput"},{"key":"4050_CR39","doi-asserted-by":"crossref","unstructured":"Zaman HRR, Gharehchopogh FS (2021) An improved particle swarm optimization with backtracking search optimization algorithm for solving continuous optimization problems. Eng Comput pp 1\u201335","DOI":"10.1007\/s00366-021-01431-6"},{"key":"4050_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1469026818500165","volume":"17","author":"T Jiang","year":"2018","unstructured":"Jiang T (2018) A hybrid grey wolf optimization for job shop scheduling problem. Int J Comput Intell Appl 17:1\u201312. https:\/\/doi.org\/10.1142\/S1469026818500165","journal-title":"Int J Comput Intell Appl"},{"key":"4050_CR41","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1109\/TCYB.2018.2817240","volume":"49","author":"K Gao","year":"2018","unstructured":"Gao K, Yang F, Zhou M et al (2018) Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm. IEEE Trans Cybern 49:1944\u20131955","journal-title":"IEEE Trans Cybern"},{"key":"4050_CR42","doi-asserted-by":"publisher","DOI":"10.1515\/jisys-2018-0331","author":"BH Abed-Alguni","year":"2020","unstructured":"Abed-Alguni BH, Paul DJ (2020) Hybridizing the cuckoo search algorithm with different mutation operators for numerical optimization problems. J Intell Syst. https:\/\/doi.org\/10.1515\/jisys-2018-0331","journal-title":"J Intell Syst"},{"key":"4050_CR43","doi-asserted-by":"publisher","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:858\u2013872","journal-title":"Eur J Oper Res"},{"key":"4050_CR44","doi-asserted-by":"publisher","unstructured":"Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G (2004) Particle swarm optimization algorithm for permutation flowshop sequencing problem. In: Lect Notes Comput Sci (including Subser Lect Notes Artif Intell Lect Notes Bioinformatics) 3172 LNCS. pp 382\u2013389. https:\/\/doi.org\/10.1007\/978-3-540-28646-2_38","DOI":"10.1007\/978-3-540-28646-2_38"},{"key":"4050_CR45","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS, Maleki I, Dizaji ZA (2021) Chaotic vortex search algorithm: metaheuristic algorithm for feature selection. Evol Intell pp 1\u201332","DOI":"10.1007\/s12065-021-00590-1"},{"key":"4050_CR46","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.eswa.2018.10.050","volume":"119","author":"S Gupta","year":"2019","unstructured":"Gupta S, Deep K (2019) A hybrid self-adaptive sine cosine algorithm with opposition based learning. Expert Syst Appl 119:210\u2013230","journal-title":"Expert Syst Appl"},{"key":"4050_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2017.09.010","volume":"39","author":"S Mahdavi","year":"2018","unstructured":"Mahdavi S, Rahnamayan S, Deb K (2018) Opposition based learning: a literature review. Swarm Evol Comput 39:1\u201323. https:\/\/doi.org\/10.1016\/j.swevo.2017.09.010","journal-title":"Swarm Evol Comput"},{"key":"4050_CR48","first-page":"1647","volume":"41","author":"X Zhou","year":"2013","unstructured":"Zhou X, Wu Z, Wang H et al (2013) Elite opposition-based particle swarm optimization. Acta Electron Sin 41:1647\u20131652","journal-title":"Acta Electron Sin"},{"key":"4050_CR49","unstructured":"Singh MK (2013) Evaluating levy flight parameters for random searches in a 2D space"},{"key":"4050_CR50","doi-asserted-by":"publisher","first-page":"6891","DOI":"10.1080\/00207543.2016.1193246","volume":"54","author":"K Wang","year":"2016","unstructured":"Wang K, Ma WQ, Luo H, Qin H (2016) Coordinated scheduling of production and transportation in a two-stage assembly flowshop. Int J Prod Res 54:6891\u20136911","journal-title":"Int J Prod Res"},{"key":"4050_CR51","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41:1069\u20131072","journal-title":"J Oper Res Soc"},{"key":"4050_CR52","doi-asserted-by":"crossref","unstructured":"Bouzidi A, Riffi ME (2014) Cat swarm optimization to solve job shop scheduling problem. In: 2014 Third IEEE International Colloquium in Information Science and Technology (CIST). IEEE, pp 202\u2013205","DOI":"10.1109\/CIST.2014.7016619"},{"key":"4050_CR53","first-page":"130","volume":"4","author":"BH Abed-alguni","year":"2018","unstructured":"Abed-alguni BH, Barhoush M (2018) Distributed grey wolf optimizer for numerical optimization problems. Jordanian J Comput Inf Technol 4:130\u2013149","journal-title":"Jordanian J Comput Inf Technol"},{"key":"4050_CR54","doi-asserted-by":"publisher","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 environments. Appl Soft Comput 102:107113","journal-title":"Appl Soft Comput"},{"key":"4050_CR55","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:57\u201382","journal-title":"Int J Artif Intell"},{"key":"4050_CR56","doi-asserted-by":"crossref","unstructured":"Ghafori S, Gharehchopogh FS (2021) Advances in spotted hyena optimizer: a comprehensive survey. Arch Comput Methods Eng pp 1\u201322","DOI":"10.1007\/s11831-021-09624-4"},{"key":"4050_CR57","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS, Abdollahzadeh B (2021) An efficient harris hawk optimization algorithm for solving the travelling salesman problem. Cluster Comput pp 1\u201325","DOI":"10.1007\/s10586-021-03304-5"},{"key":"4050_CR58","doi-asserted-by":"crossref","unstructured":"Gharehchopogh FS, Farnad B, Alizadeh A (2021) A farmland fertility algorithm for solving constrained engineering problems. Concurr Comput Pract Exp p e6310","DOI":"10.1002\/cpe.6310"},{"key":"4050_CR59","doi-asserted-by":"crossref","unstructured":"Mousavirad SJ, Schaefer G, Esmaeili L, Korovin I (2020) On improvements of the human mental search algorithm for global optimisation. In: 2020 IEEE Congress on Evolutionary Computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185525"},{"key":"4050_CR60","doi-asserted-by":"publisher","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:6771\u20136785","journal-title":"Arab J Sci Eng"},{"key":"4050_CR61","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:56\u201377","journal-title":"Jordan J Comput Inf Technol"},{"key":"4050_CR62","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 16:41\u201359","journal-title":"Int J Artif Intell"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04050-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04050-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04050-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T15:20:17Z","timestamp":1647357617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04050-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,10]]},"references-count":62,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["4050"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04050-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,10]]},"assertion":[{"value":"25 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}