{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:39Z","timestamp":1783576899087,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T00:00:00Z","timestamp":1307318400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993636.1993718","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"617-626","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Santa Claus schedules jobs on unrelated machines"],"prefix":"10.1145","author":[{"given":"Ola","family":"Svensson","sequence":"first","affiliation":[{"name":"KTH - Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_2"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/080723491"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132522"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536488"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748028"},{"key":"e_1_3_2_2_6_1","first-page":"483","volume-title":"Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA)","author":"Ebenlendr T.","year":"2008","unstructured":"T. Ebenlendr , M. Krc\u00e1l , and J. Sgall . Graph balancing: a special case of scheduling unrelated parallel machines . In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA) , pages 483 -- 490 , 2008 . T. Ebenlendr, M. Krc\u00e1l, and J. Sgall. Graph balancing: a special case of scheduling unrelated parallel machines. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 483--490, 2008."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347114"},{"key":"e_1_3_2_2_8_1","first-page":"357","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","author":"Feige U.","year":"2008","unstructured":"U. Feige . On estimation algorithms vs approximation algorithms . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) , pages 357 -- 363 , 2008 . U. Feige. On estimation algorithms vs approximation algorithms. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 357--363, 2008."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.45"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217033"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321951"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.2.324.10559"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199357078"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.05.004"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313851"},{"key":"e_1_3_2_2_18_1","volume-title":"abs\/1011.1168","author":"Svensson O.","year":"2010","unstructured":"O. Svensson . Santa claus schedules jobs on unrelated machines. CoRR , abs\/1011.1168 , 2010 . O. Svensson. Santa claus schedules jobs on unrelated machines. CoRR, abs\/1011.1168, 2010."},{"key":"e_1_3_2_2_19_1","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","year":"2001","unstructured":"V. V. Vazirani . Approximation Algorithms . Springer , 2001 . V. V. Vazirani. Approximation Algorithms. Springer, 2001."},{"key":"e_1_3_2_2_20_1","volume-title":"On the Configuration-LP for scheduling on unrelated machines. CoRR, abs\/1011.4957","author":"Verschae J.","year":"2010","unstructured":"J. Verschae and A. Wiese . On the Configuration-LP for scheduling on unrelated machines. CoRR, abs\/1011.4957 , 2010 . J. Verschae and A. Wiese. On the Configuration-LP for scheduling on unrelated machines. CoRR, abs\/1011.4957, 2010."}],"event":{"name":"STOC'11: Symposium on Theory of Computing","location":"San Jose California USA","acronym":"STOC'11","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-third annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993718","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993636.1993718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:11Z","timestamp":1750244771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993636.1993718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":19,"alternative-id":["10.1145\/1993636.1993718","10.1145\/1993636"],"URL":"https:\/\/doi.org\/10.1145\/1993636.1993718","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}