{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T02:19:07Z","timestamp":1780539547066,"version":"3.54.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Science and Technology Development Fund of Macao","award":["0015\/2023\/RIA1"],"award-info":[{"award-number":["0015\/2023\/RIA1"]}]},{"name":"Key-Area Research and Development Plan of Guangdong Province","award":["2020B010164003"],"award-info":[{"award-number":["2020B010164003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1109\/tsc.2024.3351622","type":"journal-article","created":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T21:16:48Z","timestamp":1705353408000},"page":"1181-1195","source":"Crossref","is-referenced-by-count":17,"title":["Scheduling Workflow Tasks With Unknown Task Execution Time by Combining Machine-Learning and Greedy-Optimization"],"prefix":"10.1109","volume":"17","author":[{"given":"Yuanhao","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer Science, Engineering, Sun Yat-sen University, Guangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3663-6591","authenticated-orcid":false,"given":"Hong","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Engineering, Technology, Central Queensland University, Brisbane City, QLD, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7952-571X","authenticated-orcid":false,"given":"Hui","family":"Tian","sequence":"additional","affiliation":[{"name":"School of Information, Communication Technology, Griffith University, Southport, QLD, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"112","article-title":"A time-driven scheduling model for real-time operating systems","volume-title":"Proc. IEEE 6th Real-Time Syst. Symp.","author":"Jensen"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2020.3041829"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2021.3122428"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/17m1156332"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2015.2474360"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2019.2901467"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.01.010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2019.2942909"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2003.05.005"},{"key":"ref10","first-page":"74","article-title":"Performance debugging for distributed systems of black boxes","volume-title":"Proc. 19th ACM Symp. Oper. Syst. Princ.","author":"Aguilera"},{"key":"ref11","article-title":"Using performance prediction to allocate grid resources","author":"Jang","year":"2004"},{"key":"ref12","first-page":"1","article-title":"Practical performance models for complex, popular applications","volume-title":"Proc. ACM SIGMETRICS Int. Conf. Meas. Model. Comput. Syst.","author":"Thereska"},{"key":"ref13","first-page":"368","article-title":"A regression-based approach to scalability prediction","volume-title":"Proc. 22nd Annu. Int. Conf. Supercomputing","author":"Barnes"},{"key":"ref14","first-page":"93","article-title":"Task runtime prediction in scientific workflows using an online incremental learning approach","volume-title":"Proc. 11th IEEE\/ACM Int. Conf. Utility Cloud Comput.","author":"Hilman"},{"issue":"1","key":"ref15","first-page":"256","article-title":"Predicting workflow task execution time in the cloud using a two-stage machine learning approach","volume-title":"IEEE Trans. Cloud Comput.","volume":"8","author":"Pham","year":"2020"},{"issue":"5","key":"ref16","first-page":"749","article-title":"Automated performance modeling of HPC applications using machine learning","volume-title":"IEEE Trans. Comput.","volume":"69","author":"Sun","year":"2020"},{"issue":"3","key":"ref17","first-page":"260","article-title":"Performance-effective and low-complexity task scheduling for heterogeneous computing","volume-title":"IEEE Trans. Parallel Distrib. Syst.","volume":"13","author":"Topcuoglu","year":"2002"},{"issue":"5","key":"ref18","article-title":"A list scheduling algorithm for heterogeneous systems based on a critical node cost table and pessimistic cost table","volume-title":"Concurr. Comput. Pract. Exp.","volume":"29","author":"Zhou","year":"2017"},{"key":"ref19","first-page":"270","article-title":"Learning scheduling algorithms for data processing clusters","volume-title":"Proc. ACM Special Int. Group Data Commun.","author":"Mao"},{"issue":"7540","key":"ref20","first-page":"529","article-title":"Human-level control through deep reinforcement learning","volume-title":"Nature","volume":"518","author":"Mnih","year":"2015"},{"key":"ref21","first-page":"2790","article-title":"Weighted completion time minimization for unrelated machines via iterative fair contention resolution","volume-title":"Proc. ACM-SIAM Symp. Discrete Algorithms","author":"Im"},{"key":"ref22","first-page":"891","article-title":"Need for speed: CORA scheduler for optimizing completion-times in the cloud","volume-title":"Proc. IEEE Conf. Comput. Commun.","author":"Huang"},{"key":"ref23","first-page":"1134","article-title":"Optimal approximation for submodular and supermodular optimization with bounded curvature","volume-title":"Proc. 26th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Sviridenko"},{"issue":"1\/2","key":"ref24","first-page":"103","article-title":"An FPTAS for optimizing a class of low-rank functions over a polytope","volume-title":"Math. Prog.","volume":"141","author":"Mittal","year":"2013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.3.513"},{"issue":"2","key":"ref26","first-page":"740","article-title":"An ellipsoidal branch and bound algorithm for global optimization","volume-title":"SIAM J. Optim.","volume":"20","author":"Hager","year":"2009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2741948.2741964"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00335-4"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4629386\/10554674\/10400531.pdf?arnumber=10400531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T13:27:51Z","timestamp":1719408471000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10400531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2024.3351622","relation":{},"ISSN":["1939-1374","2372-0204"],"issn-type":[{"value":"1939-1374","type":"electronic"},{"value":"2372-0204","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5]]}}}