{"id":"https://openalex.org/W2135932424","doi":"https://doi.org/10.1137/110851201","title":"Santa Claus Schedules Jobs on Unrelated Machines","display_name":"Santa Claus Schedules Jobs on Unrelated Machines","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2135932424","doi":"https://doi.org/10.1137/110851201","mag":"2135932424"},"language":"en","primary_location":{"id":"doi:10.1137/110851201","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110851201","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/184645","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":["Royal Institute of Technology -KTH Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology -KTH 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":17.8814,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.99334352,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"41","issue":"5","first_page":"1318","last_page":"1341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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.9972000122070312,"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.7877379655838013},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.690798282623291},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.636595606803894},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6254622340202332},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6038558483123779},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5963174104690552},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5600303411483765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5467008352279663},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.506070077419281},{"id":"https://openalex.org/keywords/approx","display_name":"Approx","score":0.48876094818115234},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48029085993766785},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4329865872859955},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42356374859809875},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3529665470123291},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3115336298942566},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07171064615249634}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7877379655838013},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.690798282623291},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.636595606803894},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6254622340202332},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6038558483123779},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5963174104690552},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5600303411483765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5467008352279663},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.506070077419281},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.48876094818115234},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48029085993766785},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4329865872859955},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42356374859809875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3529665470123291},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3115336298942566},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07171064615249634},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110851201","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110851201","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:infoscience.epfl.ch:184645","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/184645","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":"pmh:oai:infoscience.epfl.ch:184645","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/184645","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"},"sustainable_development_goals":[{"score":0.6800000071525574,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1992734168","https://openalex.org/W2013170874","https://openalex.org/W2014071862","https://openalex.org/W2052586468","https://openalex.org/W2072870176","https://openalex.org/W2093066443","https://openalex.org/W2095794917","https://openalex.org/W2102201348","https://openalex.org/W2142033149","https://openalex.org/W2222512263"],"related_works":["https://openalex.org/W1500270910","https://openalex.org/W1759995226","https://openalex.org/W2962917430","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W4299801389","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"One":[0],"of":[1,20,52,63,114,148,193],"the":[2,9,18,50,56,64,75,92,98,111,115,145,156,165,172,194],"classic":[3],"results":[4],"in":[5,55,204],"scheduling":[6,21],"theory":[7],"is":[8,48,79,90,104,133,140,180,199],"$2$-approximation":[10],"algorithm":[11,51,108,186],"by":[12,142],"Lenstra,":[13],"Shmoys,":[14],"and":[15],"Tardos":[16],"for":[17,97,164,175],"problem":[19,118,177],"jobs":[22],"to":[23,81,171,202],"minimize":[24],"makespan":[25,113],"on":[26,37,182],"unrelated":[27],"machines;":[28],"i.e.,":[29],"job":[30],"$j$":[31],"requires":[32],"time":[33,107],"$p_{ij}$":[34],"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,116],"model":[58],"where":[59,129],"processing":[60],"times":[61],"are":[62],"form":[65],"$p_{ij}":[66],"\\in":[67],"\\{p_j,":[68],"\\infty\\}$.":[69],"This":[70],"problem,":[71,78],"also":[72,91],"known":[73,94,154,201],"as":[74,155],"assignment":[77,117],"NP-hard":[80],"approximate":[82],"within":[83,119],"a":[84,105,120,149,183,191],"factor":[85,121],"less":[86],"$1.5$,":[88],"which":[89],"best":[93],"lower":[95],"bound":[96],"general":[99],"version.":[100],"Our":[101],"main":[102],"result":[103,139],"polynomial":[106,205],"that":[109,159,176,187],"estimates":[110],"optimal":[112],"$33/17":[122],"+":[123,127],"\\epsilon":[124],"\\approx":[125],"1.9412":[126],"\\epsilon$,":[128],"$\\epsilon":[130],">":[131],"0$":[132],"an":[134],"arbitrarily":[135],"small":[136],"constant.":[137],"The":[138],"obtained":[141],"upper":[143],"bounding":[144],"integrality":[146],"gap":[147],"certain":[150],"strong":[151],"linear":[152],"program,":[153],"configuration":[157],"LP,":[158],"was":[160],"previously":[161],"successfully":[162],"used":[163],"related":[166],"Santa":[167],"Claus":[168],"problem.":[169],"Similar":[170],"strongest":[173],"analysis":[174],"our":[178],"proof":[179],"based":[181],"local":[184],"search":[185],"will":[188],"eventually":[189],"find":[190],"schedule":[192],"mentioned":[195],"approximation":[196],"guarantee":[197],"but":[198],"not":[200],"converge":[203],"time.":[206]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}