{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:36:26Z","timestamp":1725572186202},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228233"},{"type":"electronic","value":"9783540286295"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_43","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T12:59:50Z","timestamp":1292590790000},"page":"562-573","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Preemptive Scheduling for General Target Functions"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamir","family":"Tassa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"43_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01(1), 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"43_CR2","unstructured":"Coffman Jr., E.G., Lueker, G.S.: Approximation algorithms for extensible bin packing. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 586\u2013588 (2001)"},{"issue":"5","key":"43_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","volume":"65","author":"P. Dell\u2019Olmo","year":"1998","unstructured":"Dell\u2019Olmo, P., Kellerer, H., Speranza, M.G., Tuza, Z.: A 13\/12 approximation algorithm for bin packing with extendable bins. Information Processing Letters\u00a065(5), 229\u2013233 (1998)","journal-title":"Information Processing Letters"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(99)00020-7","volume":"94","author":"P. Dell\u2019Olmo","year":"1999","unstructured":"Dell\u2019Olmo, P., Speranza, M.G.: Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discrete Applied Mathematics\u00a094, 181\u2013191 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-24749-4_18","volume-title":"STACS 2004","author":"T. Ebenlendr","year":"2004","unstructured":"Ebenlendr, T., Sgall, J.: Optimal and online preemptive scheduling on uniformly related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 199\u2013210. Springer, Heidelberg (2004)"},{"issue":"1","key":"43_CR6","first-page":"151","volume":"39","author":"L. Epstein","year":"2004","unstructured":"Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica\u00a039(1), 151\u2013162 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T. Gonzalez","year":"1978","unstructured":"Gonzalez, T., Sahni, S.: Preemptive scheduling of uniform processor systems. Journal of the ACM\u00a025(1), 92\u2013101 (1978)","journal-title":"Journal of the ACM"},{"issue":"4","key":"43_CR8","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"D.S. Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. Journal of the ACM\u00a037(4), 843\u2013862 (1990)","journal-title":"Journal of the ACM"},{"issue":"3","key":"43_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"43_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"E.C. Horvath","year":"1977","unstructured":"Horvath, E.C., Lam, S., Sethi, R.: A level algorithm for preemptive scheduling. Journal of the ACM\u00a024(1), 32\u201343 (1977)","journal-title":"Journal of the ACM"},{"key":"43_CR11","first-page":"38","volume-title":"Proceedings ACM National Conference","author":"J.W.S. Liu","year":"1974","unstructured":"Liu, J.W.S., Yang, A.T.: Optimal scheduling of independent tasks on heterogeneous computing systems. In: Proceedings ACM National Conference, vol.\u00a01, pp. 38\u201345. ACM, New York (1974)"},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/3-540-45749-6_74","volume-title":"Algorithms - ESA 2002","author":"H. Shachnai","year":"2002","unstructured":"Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing makespan and preemption costs on a system of uniform machines. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 859\u2013871. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:28:00Z","timestamp":1619998080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}