{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:56:19Z","timestamp":1742939779098,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440406"},{"type":"electronic","value":"9783540456872"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45687-2_22","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:57:47Z","timestamp":1192784267000},"page":"269-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Maximizing the Throughput of Multiprocessor Tasks"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-44450-5_37","volume-title":"Proceedings 20th Conference on Foundations of Software Technology and Theoretical Computer Science","author":"F. Afrati","year":"2000","unstructured":"F. Afrati, E. Bampis, A.V. Fishkin, K. Jansen, and C. Kenyon. Scheduling to minimize the average completion time of dedicated tasks. In Proceedings 20th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1974, pages 454\u2013464. Springer Verlag, 2000."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"P. Brucker. Scheduling Algorithms. Springer Verlag, 1998.","DOI":"10.1007\/978-3-662-03612-9"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/(SICI)1520-6750(199803)45:2<231::AID-NAV7>3.0.CO;2-9","volume":"45","author":"X. Cai","year":"1998","unstructured":"X. Cai, C.-Y. Lee, and C.-L. Li. Minimizing total completion time in two-processor task systems with prespecified processor allocation. Naval Research Logistics, 45:231\u2013242, 1998.","journal-title":"Naval Research Logistics"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF00288885","volume":"9","author":"E.G. Coffman","year":"1978","unstructured":"E.G. Coffman, J.Y-T. Leung, and D.W. Ting. Bin packing: maximizing the number of pieces packed. Acta Informatica, 9:263\u2013271, 1978.","journal-title":"Acta Informatica"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","volume":"94","author":"M. Drozdowski","year":"1996","unstructured":"M. Drozdowski. Scheduling multiprocessor tasks-an overview. European Journal of Operational Research, 94:215\u2013230, 1996.","journal-title":"European Journal of Operational Research"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","volume":"130","author":"A. Feldmann","year":"1994","unstructured":"A. Feldmann, J. Sgall, and S.-H. Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49\u201372, 1994.","journal-title":"Theoretical Computer Science"},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/3-540-48224-5_71","volume-title":"Proceedings 28th International Colloquium on Automata, Languages and Programming","author":"A.V. Fishkin","year":"2001","unstructured":"A.V. Fishkin and K. Jansen, and L. Porkolab. On minimizing average weighted completion time of multiprocessor tasks with release dates. In Proceedings 28th International Colloquium on Automata, Languages and Programming, LNCS 2076, pages 875\u2013886. Springer Verlag, 2001."},{"key":"22_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco, CA, 1979."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic scheduling: a survey. Annals of Discrete Mathematics, 5:287\u2013326, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. Hastad","year":"1999","unstructured":"J. Hastad. Clique is hard to approximate within n1\u2212\u03b5. Acta Mathematica, 182:105\u2013142, 1999.","journal-title":"Acta Mathematica"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J.A. Hoogeveen","year":"1994","unstructured":"J.A. Hoogeveen, S.L. Van de Velde, and B. Veltman. Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Applied Mathematics, 55:259\u2013272, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"H. Kellerer. A polynomial time approximation scheme for the multiple knapsack problem. RANDOM-APPROX, pages 51\u201362, 1999.","DOI":"10.1007\/978-3-540-48413-4_6"},{"key":"22_CR13","first-page":"27","volume":"S10","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler. Sequencing to minimize the weighted number of of tardy jobs. RAIRO Recherche op\u00e9rationnele, S10:27\u201333, 1976.","journal-title":"RAIRO Recherche op\u00e9rationnele"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/opre.29.1.189","volume":"29","author":"E.L. Lloyd","year":"1981","unstructured":"E.L. Lloyd. Concurrent task systems. Operations Research, 29:189\u2013201, 1981.","journal-title":"Operations Research"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.30.1.116","volume":"37","author":"C.L. Monma","year":"1982","unstructured":"C.L. Monma. Linear-time algorithms for scheduling on parallel processors. Operation Research, 37:116\u2013124, 1982.","journal-title":"Operation Research"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"J. Turek, W. Ludwig, J. Wolf, and P. Yu. Scheduling parallel tasks to minimize average response times. In Proceedings 5th ACM-SIAM Symposium on Discrete Algorithms, pages 112\u2013121, 1994.","DOI":"10.1145\/181014.181331"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2002"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45687-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T20:29:22Z","timestamp":1674505762000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45687-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440406","9783540456872"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45687-2_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"4 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}