{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T12:10:33Z","timestamp":1737375033541,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414131"},{"type":"electronic","value":"9783540444503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44450-5_37","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:26:08Z","timestamp":1187252768000},"page":"454-464","source":"Crossref","is-referenced-by-count":12,"title":["Scheduling to Minimize the Average Completion Time of Dedicated Tasks"],"prefix":"10.1007","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[]},{"given":"Evripidis","family":"Bampis","sequence":"additional","affiliation":[]},{"given":"Aleksei V.","family":"Fishkin","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Claire","family":"Kenyon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,11,24]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes forminimizing average weighted completion time with release dates, 40th Annual Symposiumon Foundations of Computer Science (FOCS\u201999), 1999, 32\u201343.","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"37_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"How to schedule independent multiprocessor tasks","author":"A.K. Amoura","year":"1997","unstructured":"A.K. Amoura, E. Bampis, C. Kenyon, Y. Manoussakis, How to schedule independent multiprocessor tasks, Proceedings of the 5th European Symposium on Algorithms(ESA\u201997), LNCS 1284, 1\u201312."},{"key":"37_CR3","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, A. Kr\u00e4mer, Polynomial algorithms for resource constrained and multi processortask scheduling problems, European Journal of Operational Research, 90(1996) 214\u2013226.","journal-title":"European Journal of Operational Research"},{"key":"37_CR4","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, C.-L. Li, Minimizing total completion time in two-processor task systems with prespecified processor allocations, Naval Research Logistics, 45 (1998)231\u2013242.","journal-title":"Naval Research Logistics"},{"key":"37_CR5","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 Discrete Mathematics,5 (1979) 287\u2013326.","journal-title":"A Survey, Annals Discrete Mathematics"},{"key":"37_CR6","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, B. Veltman, Complexity of scheduling multiprocessor tasks with prespecified processor allocations, Discrete Applied Mathematics,55 (1994) 259\u2013272.","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in Combinatorial Optimization","author":"J. Labetoulle","year":"1984","unstructured":"J. Labetoulle, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W. R. Pulleyblank(ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984,245\u2013261."}],"container-title":["Lecture Notes in Computer Science","FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44450-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:29:49Z","timestamp":1737372589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44450-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414131","9783540444503"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44450-5_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}