{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:01:03Z","timestamp":1648818063934},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":3699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0304-3975(02)00850-2","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T01:16:11Z","timestamp":1048641371000},"page":"319-335","source":"Crossref","is-referenced-by-count":4,"title":["On maximizing the throughput of multiprocessor tasks"],"prefix":"10.1016","volume":"302","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00850-2_BIB1","doi-asserted-by":"crossref","unstructured":"P. Brucker, Scheduling Algorithms, Springer, Berlin, 1998, pp. 217\u2013218.","DOI":"10.1007\/978-3-662-03612-9"},{"key":"10.1016\/S0304-3975(02)00850-2_BIB2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/(SICI)1520-6750(199803)45:2<231::AID-NAV7>3.0.CO;2-9","article-title":"Minimizing total completion time in two-processor task systems with prespecified processor allocation","volume":"45","author":"Cai","year":"1998","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00288885","article-title":"Bin packing","volume":"9","author":"Coffman","year":"1978","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","article-title":"Scheduling multiprocessor tasks\u2014an overview","volume":"94","author":"Drozdowski","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","article-title":"Dynamic scheduling on parallel machines","volume":"130","author":"Feldmann","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(02)00850-2_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"Hastad","year":"1999","journal-title":"Acta Math."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","article-title":"On-line scheduling on a single machine","volume":"27","author":"Hoogeveen","year":"2000","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","article-title":"Complexity of scheduling multiprocessor tasks with prespecified processor allocations","volume":"55","author":"Hoogeveen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB11","doi-asserted-by":"crossref","unstructured":"H. Kellerer, A polynomial time approximation scheme for the multiple knapsack problem, RANDOM-APPROX, 1999, pp. 51\u201362.","DOI":"10.1007\/978-3-540-48413-4_6"},{"key":"10.1016\/S0304-3975(02)00850-2_BIB12","first-page":"27","article-title":"Sequencing to minimize the weighted number of tardy jobs","volume":"10","author":"Lawler","year":"1976","journal-title":"RAIRO Recherche Op\u00e9ra."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.29.1.189","article-title":"Concurrent task systems","volume":"29","author":"Lloyd","year":"1981","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.30.1.116","article-title":"Linear-time algorithms for scheduling on parallel processors","volume":"37","author":"Monma","year":"1982","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(02)00850-2_BIB15","doi-asserted-by":"crossref","unstructured":"J. Turek, W. Ludwig, J. Wolf, P. Yu, Scheduling parallel tasks to minimize average response times, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, Arlington, Virginiia, ACM\/SIAM, pp. 112\u2013121.","DOI":"10.1145\/181014.181331"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T15:55:31Z","timestamp":1583942131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397502008502"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00850-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}