{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:45:27Z","timestamp":1725551127858},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_52","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T15:22:48Z","timestamp":1270480968000},"page":"116-125","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On-line load balancing for related machines"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moses","family":"Charikar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"10_CR1","unstructured":"S. Albers, Better bounds for online scheduling, Proc. 29th ACM STOC (1997), pp. 130\u2013139."},{"key":"10_CR2","unstructured":"J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, Proc. 25th ACM STOC(1993), pp. 623\u2013631."},{"key":"10_CR3","unstructured":"Y. Azar, A. Broder, A. Karlin, On-line load balancing, Proc. 33rd IEEE FOCS (1992), pp. 218\u2013225."},{"key":"10_CR4","unstructured":"Y. Azar, J. Naor, R. Rom, The competitiveness of on-line assignment, Proc. 3rd ACM-SIAM SODA (1992), pp. 203\u2013210."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A. Beck","year":"1970","unstructured":"A. Beck and D. Newman, Yet more on the linear search problem, Israel Journal of Math., 8:419\u2013429, 1970.","journal-title":"Israel Journal of Math."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"S. Chakrabarti, C. Phillips, A. Schulz, D.B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, Proc. 23rd ICALP, Springer, 1996.","DOI":"10.1007\/3-540-61440-0_166"},{"issue":"5","key":"10_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(94)00110-3","volume":"51","author":"B. Chen","year":"1970","unstructured":"B. Chen, A. van Vliet and G. J. Woeginger, A lower bound for randomized on-line scheduling algorithms, Information Processing Letters, vol.51, no.5, pp. 1970, 219\u201322.","journal-title":"Information Processing Letters"},{"key":"10_CR8","unstructured":"P. Indyk, personal communication."},{"key":"10_CR9","unstructured":"S. Gal, Search Games, Academic Press, 1980."},{"key":"10_CR10","unstructured":"M. Goemans and J. Kleinberg, An improved approximation ratio for the minimum latency problem, Proc. 7th ACM-SIAM SODA, (1996), pp. 152\u2013157."},{"key":"10_CR11","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 (1966), pp. 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"10_CR12","unstructured":"R. Motwani, S. Phillips and E. Torng, Non-clairvoyant scheduling, Proc. 4th ACMS-IAM SODA (1993), pp. 422\u2013431, see also: Theoretical Computer Science, 130 (1994), pp. 17\u201347."},{"key":"10_CR13","unstructured":"A.C. Yao, Probabilistic computations: Towards a unified measure of complexity, Proc. 17th IEEE FOGS (1977), pp. 222\u2013227."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:44:53Z","timestamp":1558255493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"30 July 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}