{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:56:21Z","timestamp":1774630581916,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004242","name":"Princess Nourah bint Abdulrahman University Researchers Supporting Project number","doi-asserted-by":"publisher","award":["PNURSP2024R333"],"award-info":[{"award-number":["PNURSP2024R333"]}],"id":[{"id":"10.13039\/501100004242","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004242","name":"Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004242","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3371693","type":"journal-article","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T18:58:20Z","timestamp":1709233100000},"page":"34208-34221","source":"Crossref","is-referenced-by-count":15,"title":["An Efficient Task Scheduling for Cloud Computing Platforms Using Energy Management Algorithm: A Comparative Analysis of Workflow Execution Time"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4034-6917","authenticated-orcid":false,"given":"Adeel","family":"Ahmed","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, The Islamia University of Bahawalpur, Bahawalpur, Pakistan"}]},{"given":"Muhammad","family":"Adnan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, The Islamia University of Bahawalpur, Bahawalpur, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1494-1381","authenticated-orcid":false,"given":"Saima","family":"Abdullah","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, The Islamia University of Bahawalpur, Bahawalpur, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5743-7364","authenticated-orcid":false,"given":"Israr","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Computing, The Islamia University of Bahawalpur, Bahawalpur, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8434-7292","authenticated-orcid":false,"given":"Nazik","family":"Alturki","sequence":"additional","affiliation":[{"name":"Department of Information Systems, College of Computer and Information Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6664-5923","authenticated-orcid":false,"given":"Leila","family":"Jamel","sequence":"additional","affiliation":[{"name":"Department of Information Systems, College of Computer and Information Science, Princess Nourah bint Abdulrahman University, P.O. Box 84428, Riyadh, Saudi Arabia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108065"},{"issue":"3","key":"ref2","first-page":"124","article-title":"Comparison analysis of CPU scheduling: FCFS, SJF and Round Robin","volume":"4","author":"Siahaan","year":"2016","journal-title":"Int. J. Eng. Dev. Res."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4018\/IJCAC.305217"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CONFLUENCE.2019.8776977"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.26438\/ijcse\/v7i2.421426"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.enconman.2022.115995"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/s21134527"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.05.011"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-021-03512-z"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-0098-3_9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.rser.2022.112168"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2021.05.012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-2594-7_63"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1504\/IJGUC.2022.125127"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109335"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-022-09852-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-021-00479-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-020-03149-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.iot.2022.100667"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-022-03713-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-022-03684-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRITO56286.2022.9965129"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11356-021-16949-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/en15239164"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3147851"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-03977-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.matpr.2021.11.121"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-03885-3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-022-03630-2"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.36548\/jismac.2022.3.003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3235360"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06488-5"},{"issue":"1","key":"ref33","first-page":"1","article-title":"Cost-efficient task scheduling algorithm for reducing energy consumption and makespan of cloud computing","volume":"5","author":"Mansouri","year":"2022","journal-title":"Comput. Knowl. Eng."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2021.100517"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04382-x"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s41870-021-00753-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-022-04464-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-03915-0"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.fss.2021.03.001"},{"key":"ref40","first-page":"8887","article-title":"Improving max-min scheduling algorithm for reducing the makespan of workflow execution in the cloud","volume":"975","author":"Al-Haboobi","year":"2022","journal-title":"Int. J. Comput. Appl."},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-19-2350-0_85"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3234998"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3390\/s22031242"},{"key":"ref44","article-title":"Above the clouds: A Berkeley view of cloud computing","author":"Armbrust","year":"2009"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/access.2022.3146295"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/access.2022.3205592"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10453553.pdf?arnumber=10453553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:52:14Z","timestamp":1710269534000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10453553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3371693","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}