{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:25:43Z","timestamp":1648751143649},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0022-0000(03)00071-0","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:48:27Z","timestamp":1057585707000},"page":"198-208","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling loosely connected task graphs"],"prefix":"10.1016","volume":"67","author":[{"given":"Abhiram G.","family":"Ranade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0022-0000(03)00071-0_BIB1","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1137\/S0097539790181889","article-title":"A new insight into the Coffman\u2013Graham algorithm","volume":"23","author":"Braschi","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00071-0_BIB2","unstructured":"M. Charikar. Approximation algorithms for problems in combinatorial optimization, B. Tech. Project Report, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay, 1995."},{"key":"10.1016\/S0022-0000(03)00071-0_BIB3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/S0022-0000(03)00071-0_BIB4","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","article-title":"Optimal sequence of two equivalent processors","volume":"17","author":"Fujii","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"6","key":"10.1016\/S0022-0000(03)00071-0_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S0022-0000(03)00071-0_BIB6","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1137\/0206037","article-title":"Worst-case analysis of two scheduling algorithms","volume":"6","author":"Lam","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00071-0_BIB7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000710?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000710?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T08:31:19Z","timestamp":1552897879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0022000003000710"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00071-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}