{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:37:27Z","timestamp":1730205447702,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,28]]},"DOI":"10.1109\/cec45853.2021.9504867","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T21:57:06Z","timestamp":1628546226000},"page":"1808-1816","source":"Crossref","is-referenced-by-count":0,"title":["A Genetic Algorithm for Scheduling Splittable Tasks with Precedence Constraints"],"prefix":"10.1109","author":[{"given":"Yuanliang","family":"Gao","sequence":"first","affiliation":[{"name":"University of Nottingham, Ningbo China,School of Computer Science,Ningbo,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheung-Hung","family":"Poon","sequence":"additional","affiliation":[{"name":"University of Nottingham, Ningbo China,School of Computer Science,Ningbo,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1002\/jos.116"},{"key":"ref32","first-page":"14","article-title":"Reducing bias and inefficiency in the selection algorithm","volume":"206","author":"baker","year":"1987","journal-title":"Proceedings of the Second International Conference on Genetic Algorithms"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1016\/j.future.2018.10.013"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/j.asoc.2014.07.021"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/3-540-48311-X_39"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/MC.2010.75"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TPDS.2012.258"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/S0377-2217(02)00264-3"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/1159892.1159899"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.jcss.2011.04.003"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TPDS.2018.2813387"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1587\/transfun.E100.A.1503"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/3373400.3373403"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/CANDAR.2018.00025"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1186\/s40064-016-2808-y"},{"year":"2006","author":"sinnen","journal-title":"Task Scheduling for Parallel Systems","key":"ref4"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/978-3-540-27866-5_30"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/MCSE.2017.29"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/140901.141909"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/j.future.2016.01.013"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.4018\/978-1-60566-661-7.ch011"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/978-3-662-44874-8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1201\/9781420039597"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.jnca.2016.01.018"},{"key":"ref9","article-title":"Complexity of Scheduling Parallel Task Systems","author":"du","year":"2006","journal-title":"SIAM J Discrete Math"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/j.future.2012.08.015"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/978-3-662-05138-2"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/IPDPS.2001.924977"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/3373400.3373409"},{"key":"ref24","volume":"1","author":"n\u2019takpe","year":"2006","journal-title":"Critical path and area based scheduling of parallel task graphs on heterogeneous platforms"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/ICPP.2001.952048"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/71.993206"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/ISPDC.2007.1"}],"event":{"name":"2021 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2021,6,28]]},"location":"Krak\u00f3w, Poland","end":{"date-parts":[[2021,7,1]]}},"container-title":["2021 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9504682\/9504683\/09504867.pdf?arnumber=9504867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:36:26Z","timestamp":1659483386000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9504867\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cec45853.2021.9504867","relation":{},"subject":[],"published":{"date-parts":[[2021,6,28]]}}}