{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:07Z","timestamp":1742596807711,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_241","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:04:59Z","timestamp":1330257899000},"page":"119-130","source":"Crossref","is-referenced-by-count":30,"title":["Online load balancing of temporary tasks"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[]},{"given":"Bala","family":"Kalyanasundaram","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Plotkin","sequence":"additional","affiliation":[]},{"given":"Kirk R.","family":"Pruhs","sequence":"additional","affiliation":[]},{"given":"Orli","family":"Waarts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"J. Aspenes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line machine scheduling with applications to load balancing and virtual circuit routing. In Proc. 23rd Annual ACM Symposium on Theory of Computing, May 1993.","DOI":"10.1145\/167088.167248"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Y. Azar, A. Broder, and A. Karlin. On-line load balancing. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pages 218\u2013225, 1992.","DOI":"10.1109\/SFCS.1992.267770"},{"key":"13_CR3","unstructured":"Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignment. In Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 203\u2013210, 1992."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Y. Bartal, A. Fiat, H. Karloff, and R. Vohra. New algorithms for an ancient scheduling problem. In Proc. 24th Annual ACM Symposium on Theory of Computing, 1992.","DOI":"10.1145\/129712.129718"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"R.L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45:1563\u20131581, 1966.","journal-title":"Bell System Technical Journal"},{"key":"13_CR6","doi-asserted-by":"crossref","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 sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287\u2013326, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"T. Leighton, F. Makedon, S. Plotkin, C. Stein, \u00c9. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problem. In Proc. 23th ACM Symposium on the Theory of Computing, pages 101\u2013111, May 1991.","DOI":"10.1145\/103418.103425"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"J.K. Lenstra, D.B. Shmoys, and \u00c9. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Math. Prog., 46:259\u2013271, 1990.","journal-title":"Math. Prog."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"S. Plotkin, D. Shmoys, and \u00c9. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 495\u2013504, October 1991.","DOI":"10.1109\/SFCS.1991.185411"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"P. Raghavan and C.D. Thompson. Provably good routing in graphs: Regular arrays. In Proc. of 17th ACM Symp. on Theory of Computing, May 1985.","DOI":"10.1145\/22145.22154"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"D. Shmoys, J. Wein, and D.P. Williamson. Scheduling parallel machines online. In Proc. 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 131\u2013140, 1991.","DOI":"10.1109\/SFCS.1991.185361"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2):202\u2013208, 1985.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_241.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:59:45Z","timestamp":1742594385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_241","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}