{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:11:01Z","timestamp":1768529461235,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T00:00:00Z","timestamp":1627689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In cloud computing, task scheduling and resource allocation are the two core issues of the IaaS layer. Efficient task scheduling algorithm can improve the matching efficiency between tasks and resources. In this paper, an enhanced heterogeneous earliest finish time based on rule (EHEFT-R) task scheduling algorithm is proposed to optimize task execution efficiency, quality of service (QoS) and energy consumption. In EHEFT-R, ordering rules based on priority constraints are used to optimize the quality of the initial solution, and the enhanced heterogeneous earliest finish time (HEFT) algorithm is used to ensure the global performance of the solution space. Simulation experiments verify the effectiveness and superiority of EHEFT-R.<\/jats:p>","DOI":"10.1007\/s40747-021-00479-7","type":"journal-article","created":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T05:03:27Z","timestamp":1627707807000},"page":"4475-4482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["EHEFT-R: multi-objective task scheduling scheme in cloud computing"],"prefix":"10.1007","volume":"8","author":[{"given":"Honglin","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yaohua","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Zaixing","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"4","key":"479_CR1","first-page":"50","volume":"53","author":"R Gupta","year":"2012","unstructured":"Gupta R (2012) Above the clouds: a view of cloud computing. Eecs Dept Univ Calif Berkeley 53(4):50\u201358","journal-title":"Eecs Dept Univ Calif Berkeley"},{"key":"479_CR2","unstructured":"Liu C, Li K, Li K et al (2017) A new service mechanism for profit optimizations of a cloud provider and its users. IEEE Trans Cloud Comput 2017:1\u20131"},{"key":"479_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.future.2020.01.036","volume":"107","author":"MZD BellendorfJulian","year":"2020","unstructured":"BellendorfJulian MZD (2020) Classification of optimization problems in fog computing. Fut Gen Comput Syst 107:158\u2013176","journal-title":"Fut Gen Comput Syst"},{"key":"479_CR4","doi-asserted-by":"crossref","unstructured":"Desikan K, Srinivasan M, Murthy C (2017) A novel distributed latency-aware data processing in fog computing-enabled IoT networks. ACM 1\u20136","DOI":"10.1145\/3083181.3083183"},{"key":"479_CR5","doi-asserted-by":"crossref","unstructured":"Wu CG, Wang L (2019) A deadline-aware estimation of distribution algorithm for resource scheduling in fog computing systems. In: 2019 IEEE Congress on Evolutionary Computation (CEC). IEEE","DOI":"10.1109\/CEC.2019.8790305"},{"key":"479_CR6","doi-asserted-by":"crossref","unstructured":"Lin Y, Shen H (2015) IEEE 2015 44th International Conference on Parallel Processing (ICPP) - Beijing, China (2015.9.1\u20132015.9.4) 2015 44th International Conference on Parallel Processing - Cloud Fog: Towards High Quality of Experience in Cloud Gaming[C]\/\/ International Conference on Parallel Processing. IEEE, 2015:500\u2013509","DOI":"10.1109\/ICPP.2015.59"},{"issue":"6","key":"479_CR7","first-page":"1171","volume":"3","author":"R Deng","year":"2017","unstructured":"Deng R, Lu R, Lai C et al (2017) Optimal workload allocation in fog-cloud computing toward balanced delay and power consumption. IEEE Internet Things J 3(6):1171\u20131181","journal-title":"IEEE Internet Things J"},{"issue":"1","key":"479_CR8","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1109\/TETC.2015.2508382","volume":"5","author":"L Gu","year":"2017","unstructured":"Gu L, Zeng D, Guo S (2017) Cost efficient resource management in fog computing supported medical cyber-physical system. IEEE Trans Emerg Top Comput 5(1):108\u2013119","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"479_CR9","doi-asserted-by":"crossref","unstructured":"Tong Z, Deng X, H Chen et al (2019) QL-HEFT: a novel machine learning scheduling scheme base on cloud computing environment. Neural Comput Appl","DOI":"10.1007\/s00521-019-04118-8"},{"key":"479_CR10","doi-asserted-by":"crossref","unstructured":"Wang X, Wang Y, Yue C (2016) An energy-aware bi-level optimization model for multi-job scheduling problems under cloud computing. Soft Comput 20(1)","DOI":"10.1007\/s00500-014-1506-3"},{"issue":"1","key":"479_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11277-018-5790-6","volume":"102","author":"S Yan","year":"2018","unstructured":"Yan S, Lin F, Xu H (2018) Multi-objective optimization of resource scheduling in fog computing using an improved NSGA-II. Wireless Pers Commun 102(1):1\u201317","journal-title":"Wireless Pers Commun"},{"issue":"3","key":"479_CR12","first-page":"100517","volume":"30","author":"M Hussain","year":"2021","unstructured":"Hussain M, Wei LF, Lakhan A et al (2021) Energy and performance-efficient task scheduling in heterogeneous virtualized cloud computing. Sustain Comput Inf Syst 30(3):100517","journal-title":"Sustain Comput Inf Syst"},{"key":"479_CR13","unstructured":"Yu H (2020) Evaluation of cloud computing resource scheduling based on improved optimization algorithm. Complex Intell Syst 2020:1\u20136"},{"issue":"1","key":"479_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s40747-020-00193-w","volume":"7","author":"XR Tao","year":"2020","unstructured":"Tao XR, Li JQ, Huang TH et al (2020) Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption. Complex Intell Syst 7(1):311","journal-title":"Complex Intell Syst"},{"issue":"1","key":"479_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s40747-020-00184-x","volume":"7","author":"X Xu","year":"2020","unstructured":"Xu X, Yin G, Wang C (2020) Multitasking scheduling with batch distribution and due date assignment. Complex Intell Syst 7(1):191","journal-title":"Complex Intell Syst"},{"issue":"23","key":"479_CR16","first-page":"237","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao K, Huang Y, Sadollah A et al (2019) A review of energy-efficient scheduling in intelligent production systems. Complex Intell Syst 6(23):237\u2013249","journal-title":"Complex Intell Syst"},{"key":"479_CR17","doi-asserted-by":"publisher","first-page":"100575","DOI":"10.1016\/j.swevo.2019.100575","volume":"51","author":"L He","year":"2019","unstructured":"He L, Li W, Zhang Y et al (2019) A discrete multi-objective fireworks algorithm for flowshop scheduling with sequence-dependent setup times. Swarm Evolut Comput 51:100575","journal-title":"Swarm Evolut Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00479-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00479-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:16:29Z","timestamp":1666876589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00479-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,31]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["479"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00479-7","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,31]]},"assertion":[{"value":"2 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2021","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 corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}