{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T17:16:25Z","timestamp":1779383785869,"version":"3.53.1"},"reference-count":35,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T00:00:00Z","timestamp":1634774400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2021,10,21]]},"abstract":"<jats:p>Despite increased cloud service providers following advanced cloud infrastructure management, substantial execution time is lost due to minimal server usage. Given the importance of reducing total execution time (makespan) for cloud service providers (as a vital metric) during sustaining Quality-of-Service (QoS), this study established an enhanced scheduling algorithm for minimal cloudlet scheduling (CS) makespan with the deep Q-network (DQN) algorithm under MCS-DQN. A novel reward function was recommended to enhance the DQN model convergence. Additionally, an open-source simulator (CloudSim) was employed to assess the suggested work performance. Resultantly, the recommended MCS-DQN scheduler revealed optimal outcomes to minimise the makespan metric and other counterparts (task waiting period, resource usage of virtual machines, and the extent of incongruence against the algorithms).<\/jats:p>","DOI":"10.1155\/2021\/7216795","type":"journal-article","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:26:58Z","timestamp":1634858818000},"page":"1-11","source":"Crossref","is-referenced-by-count":11,"title":["Makespan Optimisation in Cloudlet Scheduling with Improved DQN Algorithm in Cloud Computing"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1332-7742","authenticated-orcid":true,"given":"Amine","family":"Chraibi","sequence":"first","affiliation":[{"name":"Hassan First University of Settat, Faculty of Science and Technology, Mathematics and Computer Science Department, LAVETE Laboratory, 26000, Settat, Morocco"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1089-9948","authenticated-orcid":true,"given":"Said","family":"Ben Alla","sequence":"additional","affiliation":[{"name":"Hassan First University of Settat, Faculty of Science and Technology, Mathematics and Computer Science Department, LAVETE Laboratory, 26000, Settat, Morocco"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1456-0661","authenticated-orcid":true,"given":"Abdellah","family":"Ezzati","sequence":"additional","affiliation":[{"name":"Hassan First University of Settat, Faculty of Science and Technology, Mathematics and Computer Science Department, LAVETE Laboratory, 26000, Settat, Morocco"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/gce.2008.4738445"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4041"},{"key":"3","doi-asserted-by":"crossref","article-title":"Particle swarm optimization","author":"J. Kennedy","DOI":"10.1109\/ICNN.1995.488968"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/icscc.2019.8843624"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/csnt.2015.252"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3394"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1063\/1.4981635"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-019-02983-5"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/3436286.3436500"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/icosst51357.2020.9333057"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/iccis49240.2020.9257696"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.03.051"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/8898059"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5586521"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/8811391"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2021.101320"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/ETT.4111"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.02.018"},{"key":"19","first-page":"521","article-title":"A task scheduling algorithm based on q-learning for wsns","author":"B. Zhang"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/3046769"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.5654"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/iccc49849.2020.9238937"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2021.04.028"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1155\/2020\/1704258"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/7172842"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/8017334"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/access.2019.2902846"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05063-4_6"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/icc40277.2020.9149429"},{"key":"31","article-title":"Reinforcement learning for robots using neural networks","author":"L. J. Lin","year":"1993"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/wccct.2014.8"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1002\/spe.995"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.eij.2015.07.001"},{"key":"35","author":"M. Plappert"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/7216795.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/7216795.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2021\/7216795.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:27:00Z","timestamp":1634858820000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2021\/7216795\/"}},"subtitle":[],"editor":[{"given":"Pengwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2021,10,21]]},"references-count":35,"alternative-id":["7216795","7216795"],"URL":"https:\/\/doi.org\/10.1155\/2021\/7216795","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"value":"1875-919X","type":"electronic"},{"value":"1058-9244","type":"print"}],"subject":[],"published":{"date-parts":[[2021,10,21]]}}}