{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:45:28Z","timestamp":1725493528618},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_71","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T02:29:04Z","timestamp":1193538544000},"page":"875-886","source":"Crossref","is-referenced-by-count":11,"title":["On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates"],"prefix":"10.1007","author":[{"given":"Aleksei V.","family":"Fishkin","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Lorant","family":"Porkolab","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"71_CR1","doi-asserted-by":"crossref","unstructured":"F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Millis, M. Queyranne, M. Skutella, C. Stein, and M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, Proceedings 40th IEEE Symposium on Foundations of Computer Science (1999), 32\u201343.","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"71_CR2","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, C. Kenyon, Scheduling to minimize the average completion time of dedicated tasks, Proceedings 20th Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 1974, Springer Verlag (2000), 454\u2013464."},{"key":"71_CR3","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings 5th European Symposium on Algorithms","author":"A. K. Amoura","year":"1997","unstructured":"A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings 5th European Symposium on Algorithms, LNCS 1284, Springer Verlag (1997), 1\u201312."},{"key":"71_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1998","unstructured":"A. Bar-Noy, M. Bellare, M. M. Halld\u00f3rsson, H. Shachnai, and T. Tamir, On chromatic sums and distributed resource allocation, Information and Computation 140 (1998), 183\u2013202.","journal-title":"Information and Computation"},{"key":"71_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/3-540-48481-7_34","volume-title":"Proceedings 7th European Symposium on Algorithms","author":"A. Bar-Noy","year":"1999","unstructured":"A. Bar-Noy and M. M. Halld\u00f3rsson and G. Kortsarz and R. Salman and H. Shachnai, Sum multicoloring of graphs, Proceedings 7th European Symposium on Algorithms, LNCS 1643, Springer Verlag (1999), 390\u2013401."},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/0377-2217(95)00350-9","volume":"90","author":"P. Brucker","year":"1996","unstructured":"P. Brucker and A. Kr\u00e4mer, Polynomial algorithms for resource constrained and multiprocessor task scheduling problems, European Journal of Operational Research 90 (1996), 214\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"71_CR7","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 (1998), 231\u2013242.","journal-title":"Naval Research Logistics"},{"key":"71_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/3-540-61440-0_166","volume-title":"Proceedings 23rd International Colloquium on Automata, Languages and Programming","author":"S. Chakrabarti","year":"1996","unstructured":"S. Chakrabarti, C. A. Philips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, Proceedings 23rd International Colloquium on Automata, Languages and Programming, LNCS 1099, Springer Verlag (1996), 646\u2013657."},{"key":"71_CR9","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 on Operations Research, 94 (1996), 215\u2013230.","journal-title":"European Journal on Operations Research"},{"issue":"2","key":"71_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"U. Feige and J. Kilian, Zero-knowledge and the chromatic number, in Journal of Computer and System Science 57(2) (1998), 187\u2013199.","journal-title":"Journal of Computer and System Science"},{"key":"71_CR11","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":"71_CR12","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, K. Rinnooy Kan, Optimization and approximation in deterministic scheduling: a survey, Annals of Discrete Mathematics 5 (1979), 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"71_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L. A. Hall","year":"1997","unstructured":"L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to minimize average time: Offline and online algorithm, Mathematics of Operation Research 22 (1997), 513\u2013544.","journal-title":"Mathematics of Operation Research"},{"key":"71_CR14","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 (1994), 259\u2013272.","journal-title":"Discrete Applied Mathematics"},{"key":"71_CR15","doi-asserted-by":"crossref","unstructured":"M. Skutella and G. J. Woeginger, A PTAS for minimizing the weighted sum of job completion times on parallel machines, Proceedings 31st ACM Symposium on Theory of Computing (1999), 400\u2013407.","DOI":"10.1145\/301250.301356"},{"key":"71_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"W. E. Smith, Various optimizers for single-stage production, Naval Research Logistic Quarterly 3 (1956), 59\u201366.","journal-title":"Naval Research Logistic Quarterly"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T14:00:35Z","timestamp":1551016835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_71","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}