{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T19:27:23Z","timestamp":1791314843387,"version":"4.3.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a hybrid approach based Binary Artificial Bee Colony (BABC) and Pareto Dominance strategy for scheduling workflow applications considering different Quality of Services (QoS) requirements in cloud computing. The main purpose is to schedule a given application onto the available machines in the cloud environment with minimum makespan (i.e. schedule length) and processing cost while maximizing resource utilization without violating Service Level Agreement (SLA) among users and cloud providers. The proposed approach is called Enhanced Binary Artificial Bee Colony based Pareto Front (EBABC-PF). Our proposed approach starts by listing the tasks according to priority defined by Heterogeneous Earliest Finish Time (HEFT) algorithm, then gets an initial solution by applying Greedy Randomized Adaptive Search Procedure (GRASP) and finally schedules tasks onto machines by applying Enhanced Binary Artificial Bee Colony (BABC). Further, several modifications are considered with BABC to improve the local searching process by applying circular shift operator then mutation operator on the food sources of the population considering the improvement rate. The proposed approach is simulated and implemented in the WorkflowSim which extends the existing CloudSim tool. The performance of the proposed approach is compared with Heterogeneous Earliest Finish Time (HEFT) algorithm, Deadline Heterogeneous Earliest Finish Time (DHEFT), Non-dominated Sort Genetic Algorithm (NSGA-II) and standard Binary Artificial Bee Colony (BABC) algorithm using different sizes of tasks and various benchmark workflows. The results clearly demonstrate the efficiency of the proposed approach in terms of makespan, processing cost and resources utilization.<\/jats:p>","DOI":"10.1007\/s00607-022-01116-y","type":"journal-article","created":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T16:02:27Z","timestamp":1664640147000},"page":"217-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Enhanced hybrid multi-objective workflow scheduling approach based artificial bee colony in cloud computing"],"prefix":"10.1007","volume":"105","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3906-5090","authenticated-orcid":false,"given":"Maha","family":"Zeedan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gamal","family":"Attiya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nawal","family":"El-Fishawy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"1116_CR1","volume-title":"Cloud computing: principles and paradigms","year":"2010","unstructured":"Buyya R, James B, Andrzej MG (eds) (2010) Cloud computing: principles and paradigms, vol 87. Wiley, New York"},{"issue":"8","key":"1116_CR2","doi-asserted-by":"publisher","first-page":"e4041","DOI":"10.1002\/cpe.4041","volume":"29","author":"A Rodriguez-Maria","year":"2017","unstructured":"Rodriguez-Maria A, Rajkumar B (2017) A taxonomy and survey on scheduling algorithms for scientific workflows in IaaS cloud computing environments. Concurr Comput Pract Exp 29(8):e4041","journal-title":"Concurr Comput Pract Exp"},{"key":"1116_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein D, Vij D and Diamond S (2011) An intercloud cloud computing economy-technology, governance, and market blueprints. In: Annual SRII global conference. IEEE","DOI":"10.1109\/SRII.2011.40"},{"issue":"1","key":"1116_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-017-1044-2","volume":"52","author":"P Singh","year":"2017","unstructured":"Singh P, Dutta M, Aggarwal N (2017) A review of task scheduling based on meta-heuristics approach in cloud computing. Knowl Inf Syst 52(1):1\u201351","journal-title":"Knowl Inf Syst"},{"key":"1116_CR5","volume-title":"Metaheuristics: from design to implementation","author":"T El-Ghazali","year":"2009","unstructured":"El-Ghazali T (2009) Metaheuristics: from design to implementation, vol 74. Wiley, New York"},{"issue":"1","key":"1116_CR6","first-page":"1","volume":"98","author":"MGC Resende","year":"1998","unstructured":"Resende MGC, Ribeiro CC (1998) Greedy randomized adaptive search procedures (GRASP). AT&T Labs Res Tech Rep 98(1):1\u201311","journal-title":"AT&T Labs Res Tech Rep"},{"issue":"3","key":"1116_CR7","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s11047-018-9685-y","volume":"17","author":"MTM Emmerich","year":"2018","unstructured":"Emmerich MTM, Deutz AH (2018) A tutorial on multiobjective optimization: fundamentals and evolutionary methods. Nat Comput 17(3):585\u2013609","journal-title":"Nat Comput"},{"key":"1116_CR8","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. In: Technical report-tr06, Erciyes university, engineering faculty, computer engineering department, Vol 200"},{"key":"1116_CR9","doi-asserted-by":"crossref","unstructured":"Baykasoglu A, Ozbakir L, and Tapkan P (2007) Artificial bee colony algorithm and its application to generalized assignment problem. In: Swarm intelligence: focus on ant and particle swarm optimization 1","DOI":"10.5772\/5101"},{"key":"1116_CR10","doi-asserted-by":"crossref","unstructured":"Samadi Y, Zbakh M, and Tadonki C (2018) E-HEFT: enhancement heterogeneous earliest finish time algorithm for task scheduling based on load balancing in cloud computing. In: International conference on high performance computing & simulation (HPCS). IEEE\u200f","DOI":"10.1109\/HPCS.2018.00100"},{"key":"1116_CR11","doi-asserted-by":"crossref","unstructured":"Mazrekaj A et al. (2019) The experiential heterogeneous earliest finish time algorithm for task scheduling in clouds. In: CLOSER\u200f","DOI":"10.5220\/0007722203710379"},{"key":"1116_CR12","first-page":"1","volume":"1","author":"A Baykaso\u011flu","year":"2007","unstructured":"Baykaso\u011flu A, \u00d6zbak\u0131r L, Tapkan P (2007) Artificial bee colony algorithm and its application to generalized assignment problem. Swarm Intell Focus Ant Part Swarm Optim 1:1\u201310","journal-title":"Swarm Intell Focus Ant Part Swarm Optim"},{"key":"1116_CR13","first-page":"1","volume":"23","author":"J-Q Li","year":"2019","unstructured":"Li J-Q, Han Y-Q (2019) A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system. Clust Comput 23:1\u201317","journal-title":"Clust Comput"},{"issue":"1","key":"1116_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"Calheiros RN et al (2011) CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw Pract Exp 41(1):23\u201350","journal-title":"Softw Pract Exp"},{"key":"1116_CR15","doi-asserted-by":"crossref","unstructured":"Chen W and Deelman E (2012) WorkflowSim: a toolkit for simulating scientific workflows in distributed environments. In: IEEE 8th international conference on E-science. IEEE","DOI":"10.1109\/eScience.2012.6404430"},{"key":"1116_CR16","doi-asserted-by":"publisher","first-page":"2687","DOI":"10.1109\/ACCESS.2015.2508940","volume":"3","author":"L Zuo","year":"2015","unstructured":"Zuo L et al (2015) A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing. IEEE Access 3:2687\u20132699","journal-title":"IEEE Access"},{"key":"1116_CR17","doi-asserted-by":"crossref","unstructured":"Kimpan W and Kruekaew B (2016) Heuristic task scheduling with artificial bee colony algorithm for virtual machines. In: Joint 8th international conference on soft computing and intelligent systems (SCIS) and 17th international symposium on advanced intelligent systems (ISIS). IEEE\u200f","DOI":"10.1109\/SCIS-ISIS.2016.0067"},{"key":"1116_CR18","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TSC.2016.2616868","volume":"12","author":"Q Wu","year":"2016","unstructured":"Wu Q et al (2016) Energy and migration cost-aware dynamic virtual machine consolidation in heterogeneous cloud datacenters. IEEE Trans Serv Comput 12:550\u2013563","journal-title":"IEEE Trans Serv Comput"},{"issue":"2","key":"1116_CR19","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"1116_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10922-017-9425-0","volume":"26","author":"AS Sofia","year":"2018","unstructured":"Sofia AS, Kumar PG (2018) Multi-objective task scheduling to minimize energy consumption and makespan of cloud computing using NSGA-II. J Netw Syst Manag 26(2):463\u2013485","journal-title":"J Netw Syst Manag"},{"key":"1116_CR21","first-page":"319","volume-title":"Computational intelligence: theories applications and future directions-volume I","author":"K Naik","year":"2019","unstructured":"Naik K, Gandhi GM, Patil SH (2019) \"Multiobjective virtual machine selection for task scheduling in cloud computing. Computational intelligence: theories applications and future directions-volume I. Springer, Singapore, pp 319\u2013331"},{"key":"1116_CR22","doi-asserted-by":"publisher","first-page":"125783","DOI":"10.1109\/ACCESS.2019.2939294","volume":"7","author":"Y Gao","year":"2019","unstructured":"Gao Y, Zhang S, Zhou J (2019) A hybrid algorithm for multi-objective scientific workflow scheduling in iaas cloud. IEEE Access 7:125783\u2013125795","journal-title":"IEEE Access"},{"key":"1116_CR23","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1109\/TCC.2019.2918226","volume":"9","author":"A Marahatta","year":"2019","unstructured":"Marahatta A et al (2019) Classification-based and energy-efficient dynamic task scheduling scheme for virtualized cloud data center. IEEE Trans Cloud Comput 9:1376\u20131390","journal-title":"IEEE Trans Cloud Comput"},{"key":"1116_CR24","doi-asserted-by":"crossref","unstructured":"Shen L et al. (2019) Optimization of artificial bee colony algorithm based load balancing in smart grid cloud. In: IEEE innovative smart grid technologies-asia (ISGT Asia), IEEE","DOI":"10.1109\/ISGT-Asia.2019.8881232"},{"issue":"1","key":"1116_CR25","doi-asserted-by":"publisher","first-page":"496","DOI":"10.2991\/ijcis.d.200410.002","volume":"13","author":"B Kruekaew","year":"2020","unstructured":"Kruekaew B, Kimpan W (2020) Enhancing of artificial bee colony algorithm for virtual machine scheduling and load balancing problem in cloud computing. Int J Comput Intell Syst 13(1):496\u2013510","journal-title":"Int J Comput Intell Syst"},{"key":"1116_CR26","doi-asserted-by":"publisher","first-page":"24309","DOI":"10.1109\/ACCESS.2020.2970475","volume":"8","author":"M Farid","year":"2020","unstructured":"Farid M et al (2020) Scheduling scientific workflow using multi-objective algorithm with fuzzy resource utilization in multi-cloud environment. IEEE Access 8:24309\u201324322","journal-title":"IEEE Access"},{"key":"1116_CR27","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.2966697","author":"J Wang","year":"2020","unstructured":"Wang J et al (2020) Energy utilization task scheduling for mapreduce in heterogeneous clusters. IEEE Trans Serv Comput. https:\/\/doi.org\/10.1109\/TSC.2020.2966697","journal-title":"IEEE Trans Serv Comput"},{"key":"1116_CR28","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TASE.2019.2958979","volume":"18","author":"H Yuan","year":"2020","unstructured":"Yuan H et al (2020) Biobjective task scheduling for distributed green data centers. IEEE Trans Autom Sci Eng 18:731\u2013742","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1116_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.parco.2017.01.002","volume":"62","author":"A Verma","year":"2017","unstructured":"Verma A, Kaushal S (2017) A hybrid multi-objective particle swarm optimization for scientific workflow scheduling. Parallel Comput 62:1\u201319","journal-title":"Parallel Comput"},{"key":"1116_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00607-021-00930-0","volume":"103","author":"S Ijaz","year":"2021","unstructured":"Ijaz S et al (2021) Energy-makespan optimization of workflow scheduling in fog\u2013cloud computing. Computing 103:1\u201327","journal-title":"Computing"},{"key":"1116_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00607-021-00936-8","volume":"103","author":"G Kaur","year":"2021","unstructured":"Kaur G, Bala A (2021) Prediction based task scheduling approach for floodplain application in cloud environment. Computing 103:1\u201322","journal-title":"Computing"},{"issue":"3","key":"1116_CR32","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"issue":"1","key":"1116_CR33","doi-asserted-by":"publisher","first-page":"1091540","DOI":"10.1080\/23311916.2015.1091540","volume":"2","author":"DT Pham","year":"2015","unstructured":"Pham DT, Castellani M (2015) A comparative study of the bees algorithm as a tool for function optimisation. Cogent Eng 2(1):1091540","journal-title":"Cogent Eng"},{"issue":"2","key":"1116_CR34","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s12559-016-9447-z","volume":"9","author":"S-S Kim","year":"2017","unstructured":"Kim S-S et al (2017) Cognitively inspired artificial bee colony clustering for cognitive wireless sensor networks. Cogn Comput 9(2):207\u2013224","journal-title":"Cogn Comput"},{"key":"1116_CR35","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1002\/9780470940105.ch12","volume":"87","author":"S Pandey","year":"2011","unstructured":"Pandey S, Karunamoorthy D, Buyya R (2011) Workflow engine for clouds. Cloud Comput Princ Paradig 87:321\u2013344","journal-title":"Cloud Comput Princ Paradig"},{"issue":"3","key":"1116_CR36","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/j.future.2012.08.015","volume":"29","author":"G Juve","year":"2012","unstructured":"Juve G, Chervenak A, Deelman E, Bharathi S, Mehta G, Vahi K (2012) Characterizing and profiling scientific workflows. Future Gener Comput Syst 29(3):682\u2013692","journal-title":"Future Gener Comput Syst"},{"key":"1116_CR37","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-69277-5_7","volume-title":"Metaheuristics for scheduling in distributed computing environments","author":"J Yu","year":"2008","unstructured":"Yu J, Buyya R, Ramamohanarao K (2008) Workflow scheduling algorithms for grid computing. Metaheuristics for scheduling in distributed computing environments. Springer, Berlin, Heidelberg, pp 173\u2013214"},{"key":"1116_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2019.06.006","volume":"143","author":"M Kumar","year":"2019","unstructured":"Kumar M et al (2019) A comprehensive survey for scheduling techniques in cloud computing. J Netw Comput Appl 143:1\u201333","journal-title":"J Netw Comput Appl"},{"key":"1116_CR39","doi-asserted-by":"crossref","unstructured":"Buyya R, Ranjan R, and Calheiros RN (2009) Modeling and simulation of scalable Cloud computing environments and the cloudsim toolkit: challenges and opportunities. In: International conference on high performance computing & simulation. IEEE\u200f","DOI":"10.1109\/HPCSIM.2009.5192685"},{"key":"1116_CR40","unstructured":"Shao W, Pi D, and Shao Z (2017) A hybrid iterated greedy algorithm for the distributed no-wait flow shop scheduling problem. In: IEEE congress on evolutionary computation (CEC). IEEE"},{"key":"1116_CR41","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-91086-4_6","volume-title":"\" Handbook of metaheuristics","author":"MGC Resende","year":"2019","unstructured":"Resende MGC, Ribeiro CC (2019) \"Greedy randomized adaptive search procedures: advances and extensions. \" Handbook of metaheuristics. Springer, Cham, pp 169\u2013220"},{"key":"1116_CR42","doi-asserted-by":"publisher","DOI":"10.4324\/9781315561776","volume-title":"Basic engineering mathematics","author":"J Bird","year":"2017","unstructured":"Bird J (2017) Basic engineering mathematics. Routledge, New York"},{"key":"1116_CR43","volume-title":"A field guide to genetic programming","author":"R Poli","year":"2008","unstructured":"Poli R et al (2008) A field guide to genetic programming. Springer, Cham"},{"key":"1116_CR44","doi-asserted-by":"crossref","unstructured":"Rahman M, Ranjan R, and Buyya R (2009) A distributed heuristic for decentralized workflow 646 scheduling in global grids. In: IEEE\/ACM international conference on grid computing. IEEE","DOI":"10.1109\/GRID.2009.5353050"},{"key":"1116_CR45","unstructured":"https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01116-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-022-01116-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-022-01116-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T18:08:54Z","timestamp":1673114934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-022-01116-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,1]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1116"],"URL":"https:\/\/doi.org\/10.1007\/s00607-022-01116-y","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,1]]},"assertion":[{"value":"7 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 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":"All Authors, Eng. Maha Zeedan, Prof. Gamal Attiya, and Prof. Nawal El-Fishawy declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}