{"id":"https://openalex.org/W2074497706","doi":"https://doi.org/10.1145/1993636.1993718","title":"Santa Claus schedules jobs on unrelated machines","display_name":"Santa Claus schedules jobs on unrelated machines","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2074497706","doi":"https://doi.org/10.1145/1993636.1993718","mag":"2074497706"},"language":"en","primary_location":{"id":"doi:10.1145/1993636.1993718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993718","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993718","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["KTH - Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH - Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046999727"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":32,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"617","last_page":"626"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7912018299102783},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7026703357696533},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5744523406028748},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5299849510192871},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.473528116941452},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2984636127948761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26475822925567627},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13973349332809448},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06531405448913574}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7912018299102783},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7026703357696533},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5744523406028748},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5299849510192871},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.473528116941452},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2984636127948761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26475822925567627},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13973349332809448},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06531405448913574}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1993636.1993718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993718","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:infoscience.epfl.ch:228033","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/228033","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1145/1993636.1993718","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1993636.1993718","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1993636.1993718","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-third annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2074497706.pdf","grobid_xml":"https://content.openalex.org/works/W2074497706.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1488906711","https://openalex.org/W1502199009","https://openalex.org/W1578813712","https://openalex.org/W1605794186","https://openalex.org/W1969605458","https://openalex.org/W1978593916","https://openalex.org/W1992678640","https://openalex.org/W1992734168","https://openalex.org/W2013170874","https://openalex.org/W2014071862","https://openalex.org/W2052586468","https://openalex.org/W2072870176","https://openalex.org/W2074497706","https://openalex.org/W2081855231","https://openalex.org/W2095794917","https://openalex.org/W2102201348","https://openalex.org/W2123976299","https://openalex.org/W2142033149","https://openalex.org/W2154014787","https://openalex.org/W2569854318","https://openalex.org/W2611804663","https://openalex.org/W2950202685","https://openalex.org/W2951925262","https://openalex.org/W4250886557","https://openalex.org/W4285719527","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3204654320","https://openalex.org/W2142195909"],"abstract_inverted_index":{"One":[0],"of":[1,20,52,63],"the":[2,9,18,50,56,64,75,92,98],"classic":[3],"results":[4],"in":[5,55],"scheduling":[6,21],"theory":[7],"is":[8,48,79,90],"2-approximation":[10],"algorithm":[11,51],"by":[12],"Lenstra,":[13],"Shmoys,":[14],"and":[15],"Tardos":[16],"for":[17,97],"problem":[19],"jobs":[22],"to":[23,81],"minimize":[24],"makespan":[25],"on":[26,37],"unrelated":[27],"machines,":[28],"i.e.,":[29],"job":[30],"j":[31],"requires":[32],"time":[33],"pij":[34,66],"if":[35],"processed":[36],"machine":[38],"i.":[39],"More":[40],"than":[41,87],"two":[42],"decades":[43],"after":[44],"its":[45],"introduction":[46],"it":[47],"still":[49],"choice":[53],"even":[54],"restricted":[57,76],"model":[58],"where":[59],"processing":[60],"times":[61],"are":[62],"form":[65],"\u2208":[67],"pj,":[68],"\u221e.":[69],"This":[70],"problem,":[71,78],"also":[72,91],"known":[73,94],"as":[74],"assignment":[77],"NP-hard":[80],"approximate":[82],"within":[83],"a":[84],"factor":[85],"less":[86],"1.5":[88],"which":[89],"best":[93],"lower":[95],"bound":[96],"general":[99],"version.":[100]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}