Fusing Exploration and Exploitation: Hybrid Fireworks–Whale Optimization for Multi-Objective Independent Task Scheduling in Cloud Environments

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract Task scheduling in cloud computing environments is a complex, multi-objective optimization problem that requires balancing conflicting goals such as minimizing execution time and cost while maximizing resource utilization and throughput. Metaheuristic algorithms have proven effective for tackling such problems due to their adaptability and global search capabilities. In this work, we propose a novel family of hybrid scheduling algorithms that combine the strengths of two well-established metaheuristics: the Fireworks Algorithm (FWA)—known for its diverse exploration of the search space—and the Whale Optimization Algorithm (WOA)—recognized for its effective local exploitation. Uniquely, we design four distinct hybridization strategies: Sequential Hybrid, Parallel Hybrid, FWA-Encircling Hybrid, and WOA-Spark Hybrid, each integrating FWA and WOA in a fundamentally different manner. To the best of our knowledge, this is the first systematic study to explore multiple hybridization pathways between two metaheuristic algorithms for cloud task scheduling. Comprehensive experiments on synthetic benchmark workloads as well as the real-world GoCJ trace demonstrate that our hybrid algorithms outperform recent advanced FWA (OBDFWA), modified WOA (MWOA), and the high-performing hybrid GA–GWO methods in key metrics, such as makespan, resource utilization, and cost. Our methods achieve 2.5% to 7.5% improvements in fitness scores. Statistical validation using Friedman's rank test and the Nemenyi post-hoc test further confirms the superiority and robustness of our hybrids. Overall, this work introduces a comprehensive and pioneering hybridization framework for multi-objective cloud task scheduling.
Full text 13,784 characters · extracted from preprint-html · click to expand
Fusing Exploration and Exploitation: Hybrid Fireworks–Whale Optimization for Multi-Objective Independent Task Scheduling in Cloud Environments | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Fusing Exploration and Exploitation: Hybrid Fireworks–Whale Optimization for Multi-Objective Independent Task Scheduling in Cloud Environments Abdullah Nayem Wasi Emran, Majisha Jahan Disha, Rezwana Reaz This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6807131/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract Task scheduling in cloud computing environments is a complex, multi-objective optimization problem that requires balancing conflicting goals such as minimizing execution time and cost while maximizing resource utilization and throughput. Metaheuristic algorithms have proven effective for tackling such problems due to their adaptability and global search capabilities. In this work, we propose a novel family of hybrid scheduling algorithms that combine the strengths of two well-established metaheuristics: the Fireworks Algorithm (FWA)—known for its diverse exploration of the search space—and the Whale Optimization Algorithm (WOA)—recognized for its effective local exploitation. Uniquely, we design four distinct hybridization strategies: Sequential Hybrid, Parallel Hybrid, FWA-Encircling Hybrid, and WOA-Spark Hybrid, each integrating FWA and WOA in a fundamentally different manner. To the best of our knowledge, this is the first systematic study to explore multiple hybridization pathways between two metaheuristic algorithms for cloud task scheduling. Comprehensive experiments on synthetic benchmark workloads as well as the real-world GoCJ trace demonstrate that our hybrid algorithms outperform recent advanced FWA (OBDFWA), modified WOA (MWOA), and the high-performing hybrid GA–GWO methods in key metrics, such as makespan, resource utilization, and cost. Our methods achieve 2.5% to 7.5% improvements in fitness scores. Statistical validation using Friedman's rank test and the Nemenyi post-hoc test further confirms the superiority and robustness of our hybrids. Overall, this work introduces a comprehensive and pioneering hybridization framework for multi-objective cloud task scheduling. Cloud computing Fireworks Algorithm Hybrid Optimization Metaheuristic algorithms Task scheduling Whale Optimization Algorithm Full Text Additional Declarations No competing interests reported. Supplementary Files SupplementaryMaterial.pdf Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 31 Dec, 2025 Reviews received at journal 07 Dec, 2025 Reviews received at journal 02 Oct, 2025 Reviewers agreed at journal 23 Sep, 2025 Reviewers agreed at journal 08 Jul, 2025 Reviewers invited by journal 17 Jun, 2025 Editor assigned by journal 04 Jun, 2025 Submission checks completed at journal 03 Jun, 2025 First submitted to journal 03 Jun, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6807131","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":472535915,"identity":"fbd36992-7f94-45c3-8ce8-a83a148a3cdc","order_by":0,"name":"Abdullah Nayem Wasi Emran","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABJklEQVRIie2RMWuDQBSAXxCuHV50vSDoX7gg2ATS+ldOBLOke0dd6mLpaiB/oeBPMAi3ujq2dOjiEDehhea0lJaibcdC/eAe78F9d+/dAYyM/EHISRgdeEOMrsJPsUtoj6JiLqCOVeuLwocVg/r+JCGGG/xaIXRjPyLa67S4ezhUcOFoMBW0bsDUgum+7FOwOrNw4V+m5ZM124HnbgPVnyUc5kmmeove8TdMRxRSEaAjZJxlaOvIYZIC2r2NQauQ1zUrhfIsFcdplRcOzqBy6ss2COGsuCbtLd3huhzfHVQwz1kdk/m2JGS5Y56b5Kq3jH3qtUnfLGYUhvfyK021EEpZXckXi272ZbNand+2SY/yAeUyMLmUt/I9+QYt+2nHyMjIyH/lCELrWuPrgrB0AAAAAElFTkSuQmCC","orcid":"","institution":"Bangladesh University of Engineering and Technology","correspondingAuthor":true,"prefix":"","firstName":"Abdullah","middleName":"Nayem Wasi","lastName":"Emran","suffix":""},{"id":472535916,"identity":"fbef6733-a527-43b6-9900-b109f07e3af8","order_by":1,"name":"Majisha Jahan Disha","email":"","orcid":"","institution":"Bangladesh University of Engineering and Technology","correspondingAuthor":false,"prefix":"","firstName":"Majisha","middleName":"Jahan","lastName":"Disha","suffix":""},{"id":472535917,"identity":"8d384acc-6cab-4dc4-acbd-b478eda1b40a","order_by":2,"name":"Rezwana Reaz","email":"","orcid":"","institution":"Bangladesh University of Engineering and Technology","correspondingAuthor":false,"prefix":"","firstName":"Rezwana","middleName":"","lastName":"Reaz","suffix":""}],"badges":[],"createdAt":"2025-06-03 05:23:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6807131/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6807131/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":84911065,"identity":"c34456e4-2915-4ca4-8dbf-cdf7a293f39e","added_by":"auto","created_at":"2025-06-18 16:59:47","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":523995,"visible":true,"origin":"","legend":"","description":"","filename":"FusingExplorationandExploitationHybridFireworksWhaleOptimizationforMultiObjectiveIndependentTaskSchedulinginCloudEnvironments.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6807131/v1_covered_6e73397a-1398-4fd9-b253-607b2b842d5c.pdf"},{"id":84910230,"identity":"3ba23028-62db-44de-9b68-6fdc14bc46f2","added_by":"auto","created_at":"2025-06-18 16:51:45","extension":"pdf","order_by":0,"title":"","display":"","copyAsset":false,"role":"supplement","size":112405,"visible":true,"origin":"","legend":"","description":"","filename":"SupplementaryMaterial.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6807131/v1/82299095698318be4194fda9.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Fusing Exploration and Exploitation: Hybrid Fireworks–Whale Optimization for Multi-Objective Independent Task Scheduling in Cloud Environments","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Cloud computing, Fireworks Algorithm, Hybrid Optimization, Metaheuristic algorithms, Task scheduling, Whale Optimization Algorithm","lastPublishedDoi":"10.21203/rs.3.rs-6807131/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6807131/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Task scheduling in cloud computing environments is a complex, multi-objective optimization problem that requires balancing conflicting goals such as minimizing execution time and cost while maximizing resource utilization and throughput. Metaheuristic algorithms have proven effective for tackling such problems due to their adaptability and global search capabilities. In this work, we propose a novel family of hybrid scheduling algorithms that combine the strengths of two well-established metaheuristics: the Fireworks Algorithm (FWA)—known for its diverse exploration of the search space—and the Whale Optimization Algorithm (WOA)—recognized for its effective local exploitation. Uniquely, we design four distinct hybridization strategies: Sequential Hybrid, Parallel Hybrid, FWA-Encircling Hybrid, and WOA-Spark Hybrid, each integrating FWA and WOA in a fundamentally different manner. To the best of our knowledge, this is the first systematic study to explore multiple hybridization pathways between two metaheuristic algorithms for cloud task scheduling. Comprehensive experiments on synthetic benchmark workloads as well as the real-world GoCJ trace demonstrate that our hybrid algorithms outperform recent advanced FWA (OBDFWA), modified WOA (MWOA), and the high-performing hybrid GA–GWO methods in key metrics, such as makespan, resource utilization, and cost. Our methods achieve 2.5% to 7.5% improvements in fitness scores. Statistical validation using Friedman's rank test and the Nemenyi post-hoc test further confirms the superiority and robustness of our hybrids. Overall, this work introduces a comprehensive and pioneering hybridization framework for multi-objective cloud task scheduling.","manuscriptTitle":"Fusing Exploration and Exploitation: Hybrid Fireworks–Whale Optimization for Multi-Objective Independent Task Scheduling in Cloud Environments","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-18 16:51:40","doi":"10.21203/rs.3.rs-6807131/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-12-31T10:44:54+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-12-07T06:41:49+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-10-02T18:20:55+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"31186244095673719943546360390299448903","date":"2025-09-23T07:19:31+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"38173192506990710025237075296348148952","date":"2025-07-08T11:07:09+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-17T11:49:45+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-06-04T06:20:39+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-06-04T03:47:16+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cluster Computing","date":"2025-06-03T05:18:34+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"33efd343-e8c7-46d9-8817-14234cf35f4a","owner":[],"postedDate":"June 18th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-02T15:23:40+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-18 16:51:40","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6807131","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6807131","identity":"rs-6807131","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00