{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:30Z","timestamp":1759131990645,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/icpp.2003.1240603","type":"proceedings-article","created":{"date-parts":[[2004,6,22]],"date-time":"2004-06-22T16:27:43Z","timestamp":1087921663000},"page":"391-398","source":"Crossref","is-referenced-by-count":55,"title":["Near-optimal dynamic task scheduling of independent coarse-grained tasks onto a computational grid"],"prefix":"10.1109","author":[{"given":"N.","family":"Fujimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Hagihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7535"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321951"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"lenstra","year":"1977","journal-title":"Annals of Discrete Machines"},{"key":"ref14","article-title":"Trading cycles for information: Using replication to schedule bag-of-tasks applications on computational grids","author":"paranhos","year":"2003","journal-title":"European Conference on Parallel and Distributed Computing (Euro-Par)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/HCW.2000.843728"},{"journal-title":"Approximation Algorithms","year":"2001","author":"vazirani","key":"ref16"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0222026"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/HCW.2000.843757"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322090"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70356-X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/581571.581573"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2000.846030"},{"key":"ref9","first-page":"214","article-title":"Adaptive scheduling for master-worker applications on the computational grid","author":"heymann","year":"2000","journal-title":"IEEE\/ACM International Workshop on Grid Computing (Grid"}],"event":{"name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","start":{"date-parts":[[2003,10,9]]},"location":"Kaohsiung, Taiwan","end":{"date-parts":[[2003,10,9]]}},"container-title":["2003 International Conference on Parallel Processing, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8782\/27813\/01240603.pdf?arnumber=1240603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:16:29Z","timestamp":1497586589000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1240603\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icpp.2003.1240603","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}