{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:21:52Z","timestamp":1782346912883,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Shaanxi Natural Science Foundation Basic Research Program","award":["2023-JC-YB-601"],"award-info":[{"award-number":["2023-JC-YB-601"]}]},{"DOI":"10.13039\/501100013315","name":"Science and Technology Service Network Plan","doi-asserted-by":"publisher","award":["23GXFW0077"],"award-info":[{"award-number":["23GXFW0077"]}],"id":[{"id":"10.13039\/501100013315","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s44443-025-00332-8","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T12:27:39Z","timestamp":1764592059000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Gauss dual-mode competitive swarm optimizer algorithm in cloud computing environment"],"prefix":"10.1007","volume":"37","author":[{"given":"Bin","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiansi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,1]]},"reference":[{"issue":"17","key":"332_CR1","doi-asserted-by":"publisher","first-page":"10851","DOI":"10.1007\/s00521-025-11113-9","volume":"37","author":"B Acharya","year":"2025","unstructured":"Acharya B, Panda S, Das S, Majhi SK, Gerogiannis VC, Kanavos A (2025) Optimizing task scheduling in cloud environments: a hybrid golden search whale optimization algorithm approach. Neural Comput Appl 37(17):10851\u201373. https:\/\/doi.org\/10.1007\/s00521-025-11113-9","journal-title":"Neural Comput Appl"},{"key":"332_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2022.114570","volume":"391","author":"JO Agushaka","year":"2022","unstructured":"Agushaka JO, Ezugwu AE, Abualigah L (2022) Dwarf mongoose optimization algorithm. Comput Methods Appl Mech Eng 391:114570. https:\/\/doi.org\/10.1016\/j.cma.2022.114570","journal-title":"Comput Methods Appl Mech Eng"},{"key":"332_CR3","doi-asserted-by":"publisher","first-page":"6264","DOI":"10.1109\/TII.2022.3148288","volume":"18","author":"I Attiya","year":"2022","unstructured":"Attiya I, Elaziz MA, Abualigah L, Nguyen TN, El-Latif AAA (2022) An improved hybrid swarm intelligence for scheduling IoT application tasks in the cloud. IEEE Trans Ind Inform 18:6264\u20136272. https:\/\/doi.org\/10.1109\/TII.2022.3148288","journal-title":"IEEE Trans Ind Inform"},{"key":"332_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2023.104766","volume":"183","author":"I Behera","year":"2024","unstructured":"Behera I, Sobhanayak S (2024) Task scheduling optimization in heterogeneous cloud computing environments: a hybrid GA-GWO approach. J Parallel Distrib Comput 183:104766. https:\/\/doi.org\/10.1016\/j.jpdc.2023.104766","journal-title":"J Parallel Distrib Comput"},{"key":"332_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TCYB.2014.2322602","volume":"45","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A competitive swarm optimizer for large scale optimization. IEEE Trans Cybern 45:191\u2013204. https:\/\/doi.org\/10.1109\/TCYB.2014.2322602","journal-title":"IEEE Trans Cybern"},{"key":"332_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TSC.2017.2679738","volume":"13","author":"SG Domanal","year":"2020","unstructured":"Domanal SG, Guddeti RMR, Buyya R (2020) A hybrid bio-inspired algorithm for scheduling and resource management in cloud environment. IEEE Trans Serv Comput 13:3\u201315. https:\/\/doi.org\/10.1109\/TSC.2017.2679738","journal-title":"IEEE Trans Serv Comput"},{"key":"332_CR7","doi-asserted-by":"publisher","first-page":"9113","DOI":"10.1109\/TII.2022.3225313","volume":"19","author":"S Dong","year":"2023","unstructured":"Dong S, Xia Y, Kamruzzaman J (2023) Quantum particle swarm optimization for task offloading in mobile edge computing. IEEE Trans Ind Inf 19:9113\u20139122. https:\/\/doi.org\/10.1109\/TII.2022.3225313","journal-title":"IEEE Trans Ind Inf"},{"key":"332_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1109\/TEVC.2024.3355221","volume":"29","author":"X Gao","year":"2025","unstructured":"Gao X, Song S, Zhang H, Wang Z (2025) A flexible ranking-based competitive swarm optimizer for large-scale continuous multiobjective optimization. IEEE Trans Evol Comput 29:247\u2013261. https:\/\/doi.org\/10.1109\/TEVC.2024.3355221","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"332_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11721-007-0004-y","volume":"1","author":"S Garnier","year":"2007","unstructured":"Garnier S, Gautrais J, Theraulaz G (2007) The biological principles of swarm intelligence. Swarm Intell 1(1):3\u201331. https:\/\/doi.org\/10.1007\/s11721-007-0004-y","journal-title":"Swarm Intell"},{"key":"332_CR10","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.engappai.2012.10.004","volume":"26","author":"C-J Huang","year":"2013","unstructured":"Huang C-J, Guan C-T, Chen H-M, Wang Y-W, Chang S-C, Li C-Y et al (2013) An adaptive resource management scheme in cloud computing. Eng Appl Artif Intell 26:382\u2013389. https:\/\/doi.org\/10.1016\/j.engappai.2012.10.004","journal-title":"Eng Appl Artif Intell"},{"key":"332_CR11","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s10586-019-02983-5","volume":"23","author":"X Huang","year":"2020","unstructured":"Huang X, Li C, Chen H, An D (2020) Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies. Cluster Comput 23:1137\u20131147. https:\/\/doi.org\/10.1007\/s10586-019-02983-5","journal-title":"Cluster Comput"},{"key":"332_CR12","doi-asserted-by":"publisher","first-page":"2332","DOI":"10.1016\/j.jksuci.2020.01.012","volume":"34","author":"UK Jena","year":"2022","unstructured":"Jena UK, Das PK, Kabat MR (2022) Hybridization of meta-heuristic algorithm for load balancing in cloud computing environment. J King Saud Univ 34:2332\u20132342. https:\/\/doi.org\/10.1016\/j.jksuci.2020.01.012","journal-title":"J King Saud Univ"},{"key":"332_CR13","doi-asserted-by":"crossref","unstructured":"Keivani A, & Tapamo JR. (2019, Aug). Task Scheduling in Cloud Computing: A Review. Paper presented at the 2019 International Conference on Advances in Big Data, Computing and Data Communication Systems (icABCD).","DOI":"10.1109\/ICABCD.2019.8851045"},{"key":"332_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121510","volume":"237","author":"S Lin","year":"2024","unstructured":"Lin S, Liu A, Wang J, Kong X (2024) An improved fault-tolerant cultural-PSO with probability for multi-AGV path planning. Expert Syst Appl 237:121510. https:\/\/doi.org\/10.1016\/j.eswa.2023.121510","journal-title":"Expert Syst Appl"},{"key":"332_CR15","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.future.2023.03.029","volume":"146","author":"H Liu","year":"2023","unstructured":"Liu H, Chen P, Ouyang X, Gao H, Yan B, Grosso P et al (2023) Robustness challenges in reinforcement learning based time-critical cloud resource scheduling: a meta-learning based solution. Future Gener Comput Syst 146:18\u201333. https:\/\/doi.org\/10.1016\/j.future.2023.03.029","journal-title":"Future Gener Comput Syst"},{"key":"332_CR16","doi-asserted-by":"publisher","DOI":"10.3390\/s22030920","volume":"22","author":"S Nabi","year":"2022","unstructured":"Nabi S, Ahmad M, Ibrahim M, Hamam H (2022) AdPSO: adaptive PSO-based task scheduling approach for cloud computing. Sensors (Basel) 22:920. https:\/\/doi.org\/10.3390\/s22030920","journal-title":"Sensors (Basel)"},{"key":"332_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111880","volume":"296","author":"SO Oladejo","year":"2024","unstructured":"Oladejo SO, Ekwe SO, Mirjalili S (2024) The hiking optimization algorithm: a novel human-based metaheuristic approach. Knowl-Based Syst 296:111880. https:\/\/doi.org\/10.1016\/j.knosys.2024.111880","journal-title":"Knowl-Based Syst"},{"key":"332_CR18","doi-asserted-by":"publisher","first-page":"3988","DOI":"10.1016\/j.jksuci.2020.10.016","volume":"34","author":"A Pradhan","year":"2022","unstructured":"Pradhan A, Bisoy SK (2022) A novel load balancing technique for cloud computing platform based on PSO. J King Saud Univ 34:3988\u20133995. https:\/\/doi.org\/10.1016\/j.jksuci.2020.10.016","journal-title":"J King Saud Univ"},{"key":"332_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-024-04722-x","volume":"28","author":"A Pradhan","year":"2024","unstructured":"Pradhan A, Das A, Bisoy SK (2024) Modified parallel PSO algorithm in cloud computing for performance improvement. Cluster Comput 28:131. https:\/\/doi.org\/10.1007\/s10586-024-04722-x","journal-title":"Cluster Comput"},{"key":"332_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-024-10945-6","volume":"57","author":"X Qin","year":"2024","unstructured":"Qin X, Li S, Tong J, Xie C, Zhang X, Wu F et al (2024) Erth scheduler: enhanced red-tailed hawk algorithm for multi-cost optimization in cloud task scheduling. Artif Intell Rev 57:328. https:\/\/doi.org\/10.1007\/s10462-024-10945-6","journal-title":"Artif Intell Rev"},{"key":"332_CR21","doi-asserted-by":"publisher","first-page":"5412","DOI":"10.1109\/ACCESS.2018.2890067","volume":"7","author":"H Saleh","year":"2019","unstructured":"Saleh H, Nashaat H, Saber W, Harb HM (2019) Ipso task scheduling algorithm for large scale data in cloud computing environment. IEEE Access 7:5412\u20135420. https:\/\/doi.org\/10.1109\/ACCESS.2018.2890067","journal-title":"IEEE Access"},{"key":"332_CR22","doi-asserted-by":"publisher","first-page":"41731","DOI":"10.1109\/ACCESS.2021.3065308","volume":"9","author":"DA Shafiq","year":"2021","unstructured":"Shafiq DA, Jhanjhi NZ, Abdullah A, Alzain MA (2021) A load balancing algorithm for the data centres to optimize cloud computing applications. IEEE Access 9:41731\u201341744. https:\/\/doi.org\/10.1109\/ACCESS.2021.3065308","journal-title":"IEEE Access"},{"key":"332_CR23","doi-asserted-by":"publisher","first-page":"26149","DOI":"10.1109\/ACCESS.2022.3157435","volume":"10","author":"S Souravlas","year":"2022","unstructured":"Souravlas S, Anastasiadou SD, Tantalaki N, Katsavounis S (2022) A fair, dynamic load balanced task distribution strategy for heterogeneous cloud platforms based on Markov process modeling. IEEE Access 10:26149\u201326162. https:\/\/doi.org\/10.1109\/ACCESS.2022.3157435","journal-title":"IEEE Access"},{"key":"332_CR24","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.engappai.2012.03.011","volume":"26","author":"RF Tavares Neto","year":"2013","unstructured":"Tavares Neto RF, Godinho Filho M (2013) Literature review regarding ant colony optimization applied to scheduling problems: guidelines for implementation and directions for future research. Eng Appl Artif Intell 26:150\u2013161. https:\/\/doi.org\/10.1016\/j.engappai.2012.03.011","journal-title":"Eng Appl Artif Intell"},{"issue":"6","key":"332_CR25","doi-asserted-by":"publisher","first-page":"7621","DOI":"10.1007\/s10586-024-04378-7","volume":"27","author":"N Thapliyal","year":"2024","unstructured":"Thapliyal N, Dimri P (2024) Task scheduling using fuzzy logic with best-fit-decreasing for cloud computing environment. Cluster Comput 27(6):7621\u20137636. https:\/\/doi.org\/10.1007\/s10586-024-04378-7","journal-title":"Cluster Comput"},{"issue":"06","key":"332_CR26","first-page":"80","volume":"48","author":"Z Wang","year":"2021","unstructured":"Wang Z, Zhang Y, Shi X (2021) Cloud computing resource scheduling strategy based on competitive particle swarm algorithm. J Hunan Univ (Natl Sci) 48(06):80\u20137","journal-title":"J Hunan Univ (Natl Sci)"},{"issue":"4","key":"332_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3366682","volume":"4","author":"X Wu","year":"2019","unstructured":"Wu X, Pellegrini FD, Gao G, Casale G (2019) A framework for allocating server time to spot and on-demand services in cloud computing. ACM Transact Model Perform Evaluat Comput Syst (TOMPECS) 4(4):1\u201331. https:\/\/doi.org\/10.1145\/3366682","journal-title":"ACM Transact Model Perform Evaluat Comput Syst (TOMPECS)"},{"key":"332_CR28","doi-asserted-by":"publisher","first-page":"112","DOI":"10.26599\/TST.2022.9010065","volume":"29","author":"Q Wu","year":"2024","unstructured":"Wu Q, Fang J, Zeng J, Wen J, Luo F (2024) Monte carlo simulation-based robust workflow scheduling for spot instances in cloud environments. Tsinghua Sci Technol 29:112\u2013126. https:\/\/doi.org\/10.26599\/TST.2022.9010065","journal-title":"Tsinghua Sci Technol"},{"key":"332_CR29","doi-asserted-by":"publisher","first-page":"16033","DOI":"10.1109\/JIOT.2024.3351630","volume":"11","author":"L Ye","year":"2024","unstructured":"Ye L, Yang L, Xia Y, Zhao X (2024) A cost-driven intelligence scheduling approach for deadline-constrained IoT workflow applications in cloud computing. IEEE Internet Things J 11:16033\u201316047. https:\/\/doi.org\/10.1109\/JIOT.2024.3351630","journal-title":"IEEE Internet Things J"},{"key":"332_CR30","doi-asserted-by":"publisher","first-page":"95443","DOI":"10.1109\/ACCESS.2023.3311028","volume":"11","author":"H Zhang","year":"2023","unstructured":"Zhang H, Jia R (2023) Application of chaotic cat swarm optimization in cloud computing multi objective task scheduling. IEEE Access 11:95443\u201395454. https:\/\/doi.org\/10.1109\/ACCESS.2023.3311028","journal-title":"IEEE Access"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00332-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00332-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00332-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:47:34Z","timestamp":1767638854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00332-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["332"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00332-8","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"21 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","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":"Competing interest"}}],"article-number":"345"}}