{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:25Z","timestamp":1750309525853,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T00:00:00Z","timestamp":1739923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,19]]},"DOI":"10.1145\/3712031.3712329","type":"proceedings-article","created":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:28:34Z","timestamp":1743078514000},"page":"110-119","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Full-Path Priority Based Workflow Scheduling Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8677-6697","authenticated-orcid":false,"given":"Wei-Cheng","family":"Tseng","sequence":"first","affiliation":[{"name":"National Taichung University ofEducation, Taichung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3745-6230","authenticated-orcid":false,"given":"Kai-Yang","family":"Rong","sequence":"additional","affiliation":[{"name":"National Taichung University ofEducation, Taichung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0768-2895","authenticated-orcid":false,"given":"Kuo-Chan","family":"Huang","sequence":"additional","affiliation":[{"name":"National Taichung University ofEducation, Taichung, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3,27]]},"reference":[{"key":"e_1_3_3_1_1_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3944"},{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/465702"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2923912"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA-BDCloud-SustainCom-"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.3390\/su1107182"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/0470121173"},{"key":"e_1_3_3_1_7_2","volume-title":"Performance-effective and low-complexity task scheduling for heterogeneous computing","author":"M.","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., & Wu, M. Y. (2002). Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE transactions on parallel and distributed systems, 13(3), 260-274."},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3339186.3339206"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/PDP.2010.56","volume-title":"18th Euromicro Conference on Parallel, Distributed and Network-based Processing","author":"Bittencourt L. F.","year":"2010","unstructured":"L. F. Bittencourt, R. Sakellariou, E. R. M. Madeira, \u201cDAG scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm,\u201d 18th Euromicro Conference on Parallel, Distributed and Network-based Processing, pp. 27-34, 2010."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/TPDS.2020.3041829","article-title":"IPPTS: an efficient algorithm for scientific workflow scheduling in heterogeneous computing systems","author":"Djigal H.","year":"2021","unstructured":"H. Djigal, J. Feng, J. Lu, J. Ge, \u201cIPPTS: an efficient algorithm for scientific workflow scheduling in heterogeneous computing systems,\u201d IEEE Transactions on Parallel and Distributed Systems, pp. 1057\u20131071, 2021.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_3_1_11_2","first-page":"13","article-title":"Genetic algorithms for task scheduling problem","author":"Arafa F. A.","year":"2010","unstructured":"Omara, F. A., & Arafa, M. M. \u201cGenetic algorithms for task scheduling problem,\u201d Journal of Parallel and Distributed Computing, pp. 13-22, 2010.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.122"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1003982"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"crossref","first-page":"100280","DOI":"10.1016\/j.array.2023.100280","article-title":"An efficient ACO-based algorithm for task scheduling in heterogeneous multiprocessing environments","volume":"17","author":"Jeffrey E.","year":"2023","unstructured":"E. Jeffrey, and N. Edward. \"An efficient ACO-based algorithm for task scheduling in heterogeneous multiprocessing environments.\" Array 17 (2023): 100280.","journal-title":"Array"},{"volume-title":"Deep Reinforcement Learning","year":"2019","key":"e_1_3_3_1_15_2","unstructured":"Sewak, Mohit. Deep Reinforcement Learning. Singapore: Springer Singapore, 2019."},{"key":"e_1_3_3_1_16_2","volume-title":"Reinforcement Learning: An Introduction","author":"Barto R. S.","year":"2018","unstructured":"Sutton, R. S., Barto, A. G., Reinforcement Learning: An Introduction, MIT Press, 2018"},{"key":"e_1_3_3_1_17_2","volume-title":"Deep Learning","author":"A.","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A., Deep Learning, MIT Press, 2016"},{"key":"e_1_3_3_1_18_2","volume-title":"Mastering chess and shogi by self-play with a general reinforcement learning algorithm","author":"Silver D.","year":"1815","unstructured":"D. Silver, T. Hubert, J. Schrittwieser, \u201cMastering chess and shogi by self-play with a general reinforcement learning algorithm,\u201d arXiv:1712, p. 01815, 2017."},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3111082"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470121177.ch4"},{"key":"e_1_3_3_1_21_2","first-page":"682","article-title":"List scheduling algorithm for heterogeneous systems by an optimistic cost table","author":"Arabnejad H.","year":"2013","unstructured":"H. Arabnejad, J. G. Barbosa, \u201cList scheduling algorithm for heterogeneous systems by an optimistic cost table,\u201d IEEE Transactions on Parallel and Distributed Systems, pp. 682-694, 2013","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_3_1_22_2","first-page":"8","volume-title":"IEEE 8th International Conference on E-Science","author":"Chen W.","year":"2012","unstructured":"W. Chen, E. Deelman, \u201cWorkflowSim: a toolkit for simulating scientific workflows in distributed environments,\u201d IEEE 8th International Conference on E-Science, pp. 1\u20138, 2012"},{"key":"e_1_3_3_1_23_2","unstructured":"G. Juve etal. WorkflowGenerator https:\/\/github.com\/pegasus-isi\/WorkflowGenerator"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.995"}],"event":{"name":"HPCASIA '25: Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region","acronym":"HPCASIA '25","location":"Hsinchu Taiwan"},"container-title":["Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712031.3712329","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712031.3712329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:10Z","timestamp":1750295890000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712031.3712329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,19]]},"references-count":24,"alternative-id":["10.1145\/3712031.3712329","10.1145\/3712031"],"URL":"https:\/\/doi.org\/10.1145\/3712031.3712329","relation":{},"subject":[],"published":{"date-parts":[[2025,2,19]]},"assertion":[{"value":"2025-03-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}