{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T23:22:04Z","timestamp":1774048924753,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T00:00:00Z","timestamp":1708732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T00:00:00Z","timestamp":1708732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00607-024-01263-4","type":"journal-article","created":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T17:02:22Z","timestamp":1708794142000},"page":"1777-1793","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A multi-objective crow search algorithm for optimizing makespan and costs in scientific cloud workflows (CSAMOMC)"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2045-6008","authenticated-orcid":false,"given":"Reza","family":"Akraminejad","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3018-2821","authenticated-orcid":false,"given":"Navid","family":"Khaledian","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0455-0141","authenticated-orcid":false,"given":"Amin","family":"Nazari","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8020-4446","authenticated-orcid":false,"given":"Marcus","family":"Voelp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,24]]},"reference":[{"issue":"3","key":"1263_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1504\/IJSNET.2023.132543","volume":"42","author":"A Nazari","year":"2023","unstructured":"Nazari A et al (2023) The fuzzy-IAVOA energy-aware routing algorithm for SDN-based IoT networks. Int J Sens Netw 42(3):156\u2013169","journal-title":"Int J Sens Netw"},{"key":"1263_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13638-023-02211-0","volume":"2023","author":"A Nazari","year":"2023","unstructured":"Nazari A et al (2023) EQRSRL: an energy-aware and QoS-based routing schema using reinforcement learning in IoMT. Wirel Netw 2023:1\u201315","journal-title":"Wirel Netw"},{"key":"1263_CR3","doi-asserted-by":"publisher","first-page":"8002","DOI":"10.1016\/j.matpr.2021.02.748","volume":"46","author":"SS George","year":"2021","unstructured":"George SS, Pramila RS (2021) A review of different techniques in cloud computing. Mater Today Proc 46:8002\u20138008","journal-title":"Mater Today Proc"},{"key":"1263_CR4","doi-asserted-by":"publisher","first-page":"50782","DOI":"10.1109\/ACCESS.2021.3069142","volume":"9","author":"M Barzegaran","year":"2021","unstructured":"Barzegaran M, Pop P (2021) Communication scheduling for control performance in TSN-based fog computing platforms. IEEE Access 9:50782\u201350797","journal-title":"IEEE Access"},{"key":"1263_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2021.102336","volume":"111","author":"MR Hossain","year":"2021","unstructured":"Hossain MR et al (2021) A scheduling-based dynamic fog computing framework for augmenting resource utilization. Simul Model Pract Theory 111:102336","journal-title":"Simul Model Pract Theory"},{"key":"1263_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100841","volume":"62","author":"EH Houssein","year":"2021","unstructured":"Houssein EH et al (2021) Task scheduling in cloud computing based on meta-heuristics: review, taxonomy, open challenges, and future trends. Swarm Evol Comput 62:100841","journal-title":"Swarm Evol Comput"},{"issue":"8","key":"1263_CR7","first-page":"4888","volume":"34","author":"A Pradhan","year":"2022","unstructured":"Pradhan A, Bisoy SK, Das A (2022) A survey on PSO based meta-heuristic scheduling mechanism in cloud computing environment. J King Saud Univ Comput Inf Sci 34(8):4888\u20134901","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"1263_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2021.102353","volume":"111","author":"H Singh","year":"2021","unstructured":"Singh H et al (2021) Metaheuristics for scheduling of heterogeneous tasks in cloud computing environments: analysis, performance evaluation, and future directions. Simul Model Pract Theory 111:102353","journal-title":"Simul Model Pract Theory"},{"key":"1263_CR9","volume":"37","author":"N Khaledian","year":"2023","unstructured":"Khaledian N et al (2023) IKH-EFT: An improved method of workflow scheduling using the krill herd algorithm in the fog-cloud environment. Sustain Comput Inform Syst 37:100834","journal-title":"Sustain Comput Inform Syst"},{"key":"1263_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121038","volume":"234","author":"PV Reddy","year":"2023","unstructured":"Reddy PV, Reddy KG (2023) An energy efficient RL based workflow scheduling in cloud computing. Expert Syst Appl 234:121038","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1263_CR11","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1007\/s11227-022-04729-4","volume":"79","author":"R Rajak","year":"2023","unstructured":"Rajak R et al (2023) A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach. J Supercomput 79(2):1956\u20131979","journal-title":"J Supercomput"},{"key":"1263_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106212","volume":"154","author":"R Stewart","year":"2023","unstructured":"Stewart R, Raith A, Sinnen O (2023) Optimising makespan and energy consumption in task scheduling for parallel systems. Comput Oper Res 154:106212","journal-title":"Comput Oper Res"},{"key":"1263_CR13","volume":"36","author":"Y Kumar","year":"2022","unstructured":"Kumar Y, Kaul S, Hu Y-C (2022) Machine learning for energy-resource allocation, workflow scheduling and live migration in cloud computing: state-of-the-art survey. Sustain Comput Inform Syst 36:100780","journal-title":"Sustain Comput Inform Syst"},{"key":"1263_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2021.102828","volume":"108","author":"MH Shirvani","year":"2021","unstructured":"Shirvani MH, Talouki RN (2021) A novel hybrid heuristic-based list scheduling algorithm in heterogeneous cloud computing environment for makespan optimization. Parallel Comput 108:102828","journal-title":"Parallel Comput"},{"key":"1263_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.future.2021.04.008","volume":"123","author":"C Pe\u00f1a-Monferrer","year":"2021","unstructured":"Pe\u00f1a-Monferrer C, Manson-Sawko R, Elisseev V (2021) HPC-cloud native framework for concurrent simulation, analysis and visualization of CFD workflows. Futur Gener Comput Syst 123:14\u201323","journal-title":"Futur Gener Comput Syst"},{"key":"1263_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100938","volume":"67","author":"L Uribe","year":"2021","unstructured":"Uribe L et al (2021) A new gradient free local search mechanism for constrained multi-objective optimization problems. Swarm Evol Comput 67:100938","journal-title":"Swarm Evol Comput"},{"key":"1263_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.101012","volume":"68","author":"H Xing","year":"2022","unstructured":"Xing H et al (2022) An ACO for energy-efficient and traffic-aware virtual machine placement in cloud computing. Swarm Evol Comput 68:101012","journal-title":"Swarm Evol Comput"},{"key":"1263_CR18","doi-asserted-by":"crossref","unstructured":"Nazari A et al (2022) IETIF: intelligent energy-aware task scheduling technique in IoT\/Fog networks","DOI":"10.21203\/rs.3.rs-1454775\/v1"},{"key":"1263_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.comcom.2022.08.006","volume":"195","author":"AG Delavar","year":"2022","unstructured":"Delavar AG, Akraminejad R, Mozafari S (2022) HDECO: A method for Decreasing energy and cost by using virtual machine migration by considering hybrid parameters. Comput Commun 195:49\u201360","journal-title":"Comput Commun"},{"key":"1263_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2022.103538","volume":"209","author":"E Guler","year":"2023","unstructured":"Guler E, Karakus M, Ayaz F (2023) Genetic algorithm enabled virtual multicast tree embedding in software-defined networks. J Netw Comput Appl 209:103538","journal-title":"J Netw Comput Appl"},{"key":"1263_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2022.103528","volume":"209","author":"S Li","year":"2023","unstructured":"Li S et al (2023) Optimal cross-layer resource allocation in fog computing: a market-based framework. J Netw Comput Appl 209:103528","journal-title":"J Netw Comput Appl"},{"key":"1263_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103195","volume":"193","author":"H Hao","year":"2021","unstructured":"Hao H et al (2021) Multicast-aware optimization for resource allocation with edge computing and caching. J Netw Comput Appl 193:103195","journal-title":"J Netw Comput Appl"},{"key":"1263_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102804","volume":"135","author":"F Zhang","year":"2023","unstructured":"Zhang F et al (2023) Efficient schedulability analysis of hierarchical EDF scheduling with resource sharing. J Syst Architect 135:102804","journal-title":"J Syst Architect"},{"key":"1263_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00607-023-01215-4","volume":"106(1)","author":"N Khaledian","year":"2024","unstructured":"Khaledian N et al (2024) An energy-efficient and deadline-aware workflow scheduling algorithm in the fog and cloud environment. computing 106(1):109\u2013137.\u00a0https:\/\/doi.org\/10.1007\/s00607-023-01215-4","journal-title":"Computing"},{"key":"1263_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.compstruc.2016.03.001","volume":"169","author":"A Askarzadeh","year":"2016","unstructured":"Askarzadeh A (2016) A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm. Comput Struct 169:1\u201312","journal-title":"Comput Struct"},{"key":"1263_CR26","unstructured":"Guerreiro AP, Fonseca CM, Paquete L (2020) The hypervolume indicator: problems and algorithms. arXiv preprint arXiv:2005.00515"},{"key":"1263_CR27","unstructured":"Zitzler E, Brockhoff D, Thiele L (2007) The hypervolume indicator revisited: On the design of Pareto-compliant indicators via weighted integration. In: Evolutionary multi-criterion optimization: 4th international conference, EMO 2007, Matsushima, Japan, March 5\u20138, 2007. Proceedings 4. Springer"},{"issue":"3","key":"1263_CR28","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu M-Y (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"1263_CR29","doi-asserted-by":"publisher","first-page":"2639","DOI":"10.1007\/s10586-021-03285-5","volume":"24","author":"M Mollajafari","year":"2021","unstructured":"Mollajafari M, Shojaeefard MH (2021) TC3PoP: a time-cost compromised workflow scheduling heuristic customized for cloud environments. Clust Comput 24(3):2639\u20132656","journal-title":"Clust Comput"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01263-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-024-01263-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-024-01263-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T18:08:52Z","timestamp":1717092532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-024-01263-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,24]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1263"],"URL":"https:\/\/doi.org\/10.1007\/s00607-024-01263-4","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,24]]},"assertion":[{"value":"6 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 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":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}