{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T13:19:29Z","timestamp":1783948769026,"version":"3.55.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806138"],"award-info":[{"award-number":["61806138"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Central Government Guides Local Science and Technology Development Funds","award":["YDZJSX2021A038"],"award-info":[{"award-number":["YDZJSX2021A038"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61003053"],"award-info":[{"award-number":["61003053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cloud Comput."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tcc.2023.3315014","type":"journal-article","created":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:41:04Z","timestamp":1694626864000},"page":"3685-3699","source":"Crossref","is-referenced-by-count":50,"title":["Multi-Objective Cloud Task Scheduling Optimization Based on Evolutionary Multi-Factor Algorithm"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7388-3180","authenticated-orcid":false,"given":"Zhihua","family":"Cui","sequence":"first","affiliation":[{"name":"College of Computer Science, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1567-7778","authenticated-orcid":false,"given":"Tianhao","family":"Zhao","sequence":"additional","affiliation":[{"name":"College of Computer Science, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4952-8955","authenticated-orcid":false,"given":"Linjie","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Computer Science, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6631-1651","authenticated-orcid":false,"given":"A. K.","family":"Qin","sequence":"additional","affiliation":[{"name":"Department of Computing Technologies, Swinburne University of Technology, Hawthorn, VIC, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8611-3608","authenticated-orcid":false,"given":"Jianwei","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science, Taiyuan University of Science and Technology, Taiyuan, Shanxi, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.2964537"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2020.2964552"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06488-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-020-03075-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2013.17"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1186\/s13677-021-00237-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-03686-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9729-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-020-00308-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.09.016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.23919\/CSMS.2021.0023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3040019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990500"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.aej.2021.04.051"},{"issue":"3","key":"ref15","article-title":"A high-efficient multi-deme genetic algorithm with better load-balance","volume":"9","author":"Wang","year":"2018","journal-title":"Int. J. Comput. Sci. Math."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2792984"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2018.12.015"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01887-x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2362558"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5529-2_5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2009.191"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2458037"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9005525"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281533"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-019-06566-w"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/edcav.2015.7060544"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-018-2867-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3837\/tiis.2017.09.008"},{"issue":"12","key":"ref31","first-page":"2253","article-title":"Adaptive management and multi-objective optimization for virtual machine placement in cloud computing","volume":"34","author":"Qiang","year":"2011","journal-title":"Chin. J. Comput."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.11.019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.36548\/jismac.2020.3.001"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04119-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2014.18"},{"key":"ref36","article-title":"Cloud computing task scheduling based on optimized imperialist competitive algorithm","author":"Wang","year":"2019","journal-title":"Bull. Sci. Technol."},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01448-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01327-4"},{"key":"ref39","first-page":"6833","article-title":"A task scheduling algorithm based on improved ant colony optimization in cloud computing environment","volume":"13","author":"Li","year":"2011","journal-title":"Energy Procedia"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.12.020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s13319-019-0222-2"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2016.7464133"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2969025"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2845361"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2904696"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2974100"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2019.2916051"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3107435"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2019.2945775"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2962865"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-022-10012-8"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3018484"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2955599"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.02.031"},{"key":"ref55","article-title":"Multi-factorial optimization for large-scale virtual machine placement in cloud computing","author":"Liang","year":"2020"}],"container-title":["IEEE Transactions on Cloud Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245519\/10345387\/10250912.pdf?arnumber=10250912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T01:22:55Z","timestamp":1703035375000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10250912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":55,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcc.2023.3315014","relation":{},"ISSN":["2168-7161","2372-0018"],"issn-type":[{"value":"2168-7161","type":"electronic"},{"value":"2372-0018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}