{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:57:08Z","timestamp":1775145428365,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T00:00:00Z","timestamp":1671753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006261","name":"Taif University","doi-asserted-by":"publisher","award":["Researchers Supporting Project number (TURSP-2020\/231)"],"award-info":[{"award-number":["Researchers Supporting Project number (TURSP-2020\/231)"]}],"id":[{"id":"10.13039\/501100006261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Fog computing is an emerging research domain to provide computational services such as data transmission, application processing and storage mechanism. Fog computing consists of a set of fog server machines used to communicate with the mobile user in the edge network. Fog is introduced in cloud computing to meet data and communication needs for Internet of Things (IoT) devices. However, the vital challenges in this system are job scheduling, which is solved by examining the makespan, minimizing energy depletion and proper resource allocation. In this paper, we introduced a reinforced strategy Dynamic Opposition Learning based Social Spider Optimization (DOLSSO) Algorithm to enhance individual superiority and schedule workflow in Fog computing. The extensive experiments were conducted using the FogSim simulator to generate the dataset and an energy-efficient open-source tool utilized to model and simulate resource management in fog computing. The performance of the formulated model is ratified using two test cases. The proposed algorithm attained the optimized schedule with minimized cost function concerning the CPU processing period and assigned memory. Our simulation outcomes show the efficacy of the introduced technique in handling job scheduling issues, and the results are contrasted with five existing metaheuristic techniques. The results show that the proposed method achieves 10% - 15% better CPU utilization and 5%-10% less energy consumption than the other techniques.<\/jats:p>","DOI":"10.1186\/s13677-022-00380-9","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T13:04:59Z","timestamp":1671800699000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Job scheduling problem in fog-cloud-based environment using reinforced social spider optimization"],"prefix":"10.1186","volume":"11","author":[{"given":"P.","family":"Kuppusamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. Marline Joys","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wael Y.","family":"Alghamdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hashem","family":"Alyami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajakumar","family":"Ramalingam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul Rehman","family":"Javed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamoon","family":"Rashid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,23]]},"reference":[{"issue":"6","key":"380_CR1","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.future.2008.12.001","volume":"25","author":"R Buyya","year":"2009","unstructured":"Buyya R, Yeo CS, Venugopal S, Broberg J, Brandic I (2009) Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility. Futur Gener Comput Syst 25(6):599\u2013616","journal-title":"Futur Gener Comput Syst"},{"key":"380_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/EISIC.2015.14","volume-title":"Intelligence and security informatics conference (EISIC), 2015 European","author":"A Eleyan","year":"2015","unstructured":"Eleyan A, Eleyan D (2015) Forensic process as a service (FPaaS) for cloud computing. In: Intelligence and security informatics conference (EISIC), 2015 European. IEEE, pp 157\u2013160"},{"key":"380_CR3","unstructured":"The Network.Cisco Delivers Vision of Fog Computing to Accelerate Value from Billions of Connected Devices. http:\/\/newsroom.cisco.com\/press-release-content?articleId=1334100.M"},{"issue":"6","key":"380_CR4","first-page":"1171","volume":"3","author":"R Deng","year":"2016","unstructured":"Deng R, Rongxing L, Lai C, Luan TH, Liang H (2016) Optimal workload allocation in fog-cloud computing toward balanced delay and power consumption. IEEE Internet Things J 3(6):1171\u20131181","journal-title":"IEEE Internet Things J"},{"key":"380_CR5","doi-asserted-by":"publisher","first-page":"107349","DOI":"10.1016\/j.asoc.2021.107349","volume":"106","author":"MA \u015eahman","year":"2021","unstructured":"\u015eahman MA (2021) A discrete spotted hyena optimizer for solving distributed job shop scheduling problems. Appl Soft Comput 106:107349","journal-title":"Appl Soft Comput"},{"issue":"17","key":"380_CR6","doi-asserted-by":"publisher","first-page":"7754","DOI":"10.1016\/j.eswa.2014.06.023","volume":"41","author":"B Naderi","year":"2014","unstructured":"Naderi B, Azab A (2014) Modeling and heuristics for scheduling of distributed job shops. Expert Syst Appl 41(17):7754\u20137763","journal-title":"Expert Syst Appl"},{"issue":"4","key":"380_CR7","first-page":"497","volume":"4","author":"J Gao","year":"2011","unstructured":"Gao J, Chen R (2011) A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. Int J Comput Intell Syst 4(4):497\u2013508","journal-title":"Int J Comput Intell Syst"},{"key":"380_CR8","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1016\/j.promfg.2020.01.350","volume":"39","author":"J Xie","year":"2019","unstructured":"Xie J, Gao L, Pan Q-k, Fatih Tasgetiren M (2019) An effective multi-objective artificial bee colony algorithm for energy efficient distributed job shop scheduling. Proc Manufact 39:1194\u20131203","journal-title":"Proc Manufact"},{"issue":"1","key":"380_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00170-007-0945-8","volume":"37","author":"D Lei","year":"2008","unstructured":"Lei D (2008) Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems. Int J Adv Manuf Technol 37(1):157\u2013165","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"380_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.rcim.2006.06.004","volume":"23","author":"A Rossi","year":"2007","unstructured":"Rossi A, Dini G (2007) Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robot Comput Integr Manuf 23(5):503\u2013516","journal-title":"Robot Comput Integr Manuf"},{"issue":"6","key":"380_CR11","first-page":"1","volume":"5","author":"S Singh","year":"2015","unstructured":"Singh S, Kurmi J, Tiwari SP (2015) A hybrid genetic and cuckoo search algorithm for job scheduling. Int J Sci Res Publ 5(6):1\u20134","journal-title":"Int J Sci Res Publ"},{"issue":"3","key":"380_CR12","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"37","author":"L Wang","year":"2010","unstructured":"Wang L, Pan Q-K, Suganthan PN, Wang W-H, Wang Y-M (2010) A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput Oper Res 37(3):509\u2013520","journal-title":"Comput Oper Res"},{"key":"380_CR13","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.asoc.2018.11.043","volume":"75","author":"C Lu","year":"2019","unstructured":"Lu C, Gao L, Pan Q, Li X, Zheng J (2019) A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution. Appl Soft Comput 75:728\u2013749","journal-title":"Appl Soft Comput"},{"key":"380_CR14","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 87:105954","journal-title":"Appl Soft Comput"},{"issue":"1","key":"380_CR15","doi-asserted-by":"publisher","first-page":"6","DOI":"10.7763\/IJMLC.2014.V4.377","volume":"4","author":"Y Atay","year":"2014","unstructured":"Atay Y, Kodaz H (2014) Implementation of CSA with clone-mutation mechanism to the JSSP. Int J Mach Learn Comput 4(1):6","journal-title":"Int J Mach Learn Comput"},{"key":"380_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-981-15-7106-0_16","volume-title":"Machine learning for predictive analysis","author":"T Bezdan","year":"2021","unstructured":"Bezdan T, Zivkovic M, Antonijevic M, Zivkovic T, Bacanin N (2021) Enhanced flower pollination algorithm for task scheduling in cloud computing environment. In: Machine learning for predictive analysis. Springer, Singapore, pp 163\u2013171"},{"issue":"3","key":"380_CR17","doi-asserted-by":"publisher","first-page":"4236","DOI":"10.1007\/s11227-021-04018-6","volume":"78","author":"AM Yadav","year":"2022","unstructured":"Yadav AM, Tripathi KN, Sharma SC (2022) A bi-objective task scheduling approach in fog computing using hybrid fireworks algorithm. J Supercomput 78(3):4236\u20134260","journal-title":"J Supercomput"},{"issue":"1","key":"380_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10586-021-03371-8","volume":"25","author":"A Najafizadeh","year":"2022","unstructured":"Najafizadeh A, Salajegheh A, Rahmani AM, Sahafi A (2022) Multi-objective task scheduling in cloud-fog computing using goal programming approach. Clust Comput 25(1):141\u2013165","journal-title":"Clust Comput"},{"issue":"3","key":"380_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1504\/IJBIC.2020.111278","volume":"16","author":"X Wu","year":"2020","unstructured":"Wu X, Shen X, Zhao N, Shaomin W (2020) An improved discrete pigeon-inspired optimisation algorithm for flexible job shop scheduling problem. Int J Bio-Inspir Comput 16(3):181\u2013194","journal-title":"Int J Bio-Inspir Comput"},{"issue":"16","key":"380_CR20","doi-asserted-by":"publisher","first-page":"6374","DOI":"10.1016\/j.eswa.2013.05.041","volume":"40","author":"E Cuevas","year":"2013","unstructured":"Cuevas E, Cienfuegos M, Zald\u00edvar D, P\u00e9rez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374\u20136384","journal-title":"Expert Syst Appl"},{"issue":"17","key":"380_CR21","doi-asserted-by":"publisher","first-page":"12953","DOI":"10.1007\/s00500-020-04718-w","volume":"24","author":"E Ba\u015f","year":"2020","unstructured":"Ba\u015f E, \u00dclker E (2020) A binary social spider algorithm for continuous optimization task. Soft Comput 24(17):12953\u201312979","journal-title":"Soft Comput"},{"issue":"2","key":"380_CR22","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.eswa.2013.07.067","volume":"41","author":"E Cuevas","year":"2014","unstructured":"Cuevas E, Cienfuegos M (2014) A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Syst Appl 41(2):412\u2013425","journal-title":"Expert Syst Appl"},{"key":"380_CR23","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.swevo.2017.07.011","volume":"38","author":"DP Mahato","year":"2018","unstructured":"Mahato DP, Singh RS (2018) On maximizing reliability of grid transaction processing system considering balanced task allocation using social spider optimization. Swarm Evol Comput 38:202\u2013217","journal-title":"Swarm Evol Comput"},{"key":"380_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.engappai.2017.06.004","volume":"64","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Zhou Y, Luo Q, Abdel-Basset M (2017) A simplex method-based social spider optimization algorithm for clustering analysis. Eng Appl Artif Intell 64:67\u201382","journal-title":"Eng Appl Artif Intell"},{"key":"380_CR25","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.eswa.2016.02.024","volume":"55","author":"S Ouadfel","year":"2016","unstructured":"Ouadfel S, Taleb-Ahmed A (2016) Social spiders\u2019 optimization and flower pollination algorithm for multi-level image thresholding: a performance study. Expert Syst Appl 55:566\u2013584","journal-title":"Expert Syst Appl"},{"issue":"6","key":"380_CR26","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TPDS.2005.71","volume":"16","author":"Z Shao","year":"2005","unstructured":"Shao Z, Zhuge Q, Xue C, Sha EH-M (2005) Efficient assignment and scheduling for heterogeneous dsp systems. IEEE Trans Parallel Distrib Syst 16(6):516\u2013525","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"380_CR27","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/CC.2016.7445510","volume":"13","author":"S Ningning","year":"2016","unstructured":"Ningning S, Chao G, Xingshuo A, Qiang Z (2016) Fog computing dynamic load balancing mechanism based on graph repartitioning. China Commun 13(3):156\u2013164","journal-title":"China Commun"},{"key":"380_CR28","doi-asserted-by":"crossref","unstructured":"Cardellini V, Grassi V, Presti FL, Nardelli M (2015) On QoS-aware scheduling of data stream applications over fog computing infrastructures. In: Computers and communication (ISCC), 2015 IEEE symposium on. IEEE, Larnaca, p 271\u201376.","DOI":"10.1109\/ISCC.2015.7405527"},{"key":"380_CR29","doi-asserted-by":"crossref","unstructured":"Oueis J, Strinati EC, Barbarossa S (2015) The fog balancing: load distribution for small cell cloud computing. In: Vehicular technology conference (VTC spring), 2015 IEEE 81st. IEEE, Glasgow, p 1\u20136.","DOI":"10.1109\/VTCSpring.2015.7146129"},{"key":"380_CR30","doi-asserted-by":"crossref","unstructured":"den Bossche V, Ruben KV, Broeckhove J (2011) Cost-efficient scheduling heuristics for deadline constrained workloads on hybrid clouds. In: Cloud computing technology and science (CloudCom), 2011 IEEE third international conference on. IEEE, Athens, p 320\u201327.","DOI":"10.1109\/CloudCom.2011.50"},{"key":"380_CR31","doi-asserted-by":"crossref","unstructured":"Zeng L, Veeravalli B, Li X (2012) Scalestar: budget conscious scheduling precedence-constrained many-task workflow applications in cloud. In: Advanced information networking and applications (AINA), 2012 IEEE 26th international conference on. IEEE, Fukuoka, p 534\u201341.","DOI":"10.1109\/AINA.2012.12"},{"key":"380_CR32","doi-asserted-by":"crossref","unstructured":"Fleming PJ, Zalzala AMS (editor) (1997) Genetic algorithms in engineering systems. Institution of Electrical Engineers,\u00a0Herts","DOI":"10.1049\/PBCE055E"},{"issue":"1","key":"380_CR33","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s00170-015-7080-8","volume":"81","author":"B Naderi","year":"2015","unstructured":"Naderi B, Azab A (2015) An improved model and novel simulated annealing for distributed job shop problems. Int J Adv Manuf Technol 81(1):693\u2013703","journal-title":"Int J Adv Manuf Technol"},{"key":"380_CR34","doi-asserted-by":"publisher","first-page":"108694","DOI":"10.1016\/j.asoc.2022.108694","volume":"120","author":"H Tang","year":"2022","unstructured":"Tang H, Fang B, Liu R, Li Y, Guo S (2022) A hybrid teaching and learning-based optimization algorithm for distributed sand-casting job-shop scheduling problem. Appl Soft Comput 120:108694","journal-title":"Appl Soft Comput"},{"key":"380_CR35","series-title":"Expert Systems with Applications","doi-asserted-by":"publisher","first-page":"117182","DOI":"10.1016\/j.eswa.2022.117182","volume-title":"A hybrid differential evolution algorithm for flexible job shop scheduling with outsourcing operations and job priority constraints","author":"H Li","year":"2022","unstructured":"Li H, Wang X, Peng J (2022) A hybrid differential evolution algorithm for flexible job shop scheduling with outsourcing operations and job priority constraints, Expert Systems with Applications, p 117182, ISSN 0957-4174. https:\/\/doi.org\/10.1016\/j.eswa.2022.117182"},{"key":"380_CR36","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.procs.2018.10.417","volume":"143","author":"S Aggarwal","year":"2018","unstructured":"Aggarwal S, Chatterjee P, Bhagat RP, Purbey KK, Nanda SJ (2018) A social spider optimization algorithm with chaotic initialization for robust clustering. Proc Comput Sci 143:450\u2013457","journal-title":"Proc Comput Sci"},{"issue":"188","key":"380_CR37","doi-asserted-by":"publisher","first-page":"104966","DOI":"10.1016\/j.knosys.2019.104966","volume":"5","author":"Y Xu","year":"2020","unstructured":"Xu Y, Yang Z, Li X, Kang H, Yang X (2020) Dynamic opposite learning enhanced teaching\u2013learning-based optimization. Knowl-Based Syst 5(188):104966","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"380_CR38","doi-asserted-by":"publisher","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","volume":"38","author":"G Zhang","year":"2011","unstructured":"Zhang G, Gao L, Shi Y (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Syst Appl 38(4):3563\u20133573","journal-title":"Expert Syst Appl"},{"key":"380_CR39","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.advengsoft.2017.01.004","volume":"105","author":"S Saremi","year":"2017","unstructured":"Saremi S, Mirjalili S, Lewis A (2017) Grasshopper optimisation algorithm: theory and application. Adv Eng Softw 105:30\u201347","journal-title":"Adv Eng Softw"},{"key":"380_CR40","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.advengsoft.2017.07.002","volume":"114","author":"S Mirjalili","year":"2017","unstructured":"Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H, Mirjalili SM (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163\u2013191","journal-title":"Adv Eng Softw"},{"issue":"2","key":"380_CR41","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.icte.2018.07.002","volume":"5","author":"G Natesan","year":"2019","unstructured":"Natesan G, Chokkalingam A (2019) Task scheduling in heterogeneous cloud environment using mean grey wolf optimization algorithm. ICT Express 5(2):110\u2013114","journal-title":"ICT Express"},{"issue":"11","key":"380_CR42","doi-asserted-by":"publisher","first-page":"220","DOI":"10.3390\/math6110220","volume":"6","author":"T Jiang","year":"2018","unstructured":"Jiang T, Zhang C, Zhu H, Jiuchun G, Deng G (2018) Energy-efficient scheduling for a job shop using an improved whale optimization algorithm. Mathematics 6(11):220","journal-title":"Mathematics"},{"key":"380_CR43","doi-asserted-by":"crossref","unstructured":"Bitam S, Zeadally S, Mellouk A\u00a0 (2017) Fog computing job scheduling optimization based on bees swarm. Enterp Inf Syst 12,(4):1\u201325.","DOI":"10.1080\/17517575.2017.1304579"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00380-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-022-00380-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00380-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T13:08:27Z","timestamp":1671800907000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-022-00380-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,23]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["380"],"URL":"https:\/\/doi.org\/10.1186\/s13677-022-00380-9","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,23]]},"assertion":[{"value":"25 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"99"}}