{"id":"https://openalex.org/W2908654738","doi":"https://doi.org/10.1137/17m111835x","title":"Tight Bounds for Online Vector Scheduling","display_name":"Tight Bounds for Online Vector Scheduling","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2908654738","doi":"https://doi.org/10.1137/17m111835x","mag":"2908654738"},"language":"en","primary_location":{"id":"doi:10.1137/17m111835x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m111835x","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sungjin Im","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025412267","display_name":"Nathaniel Kell","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nathaniel Kell","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043137436","display_name":"Janardhan Kulkarni","orcid":"https://orcid.org/0009-0005-9980-7836"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006392819"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1141,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.79393993,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"48","issue":"1","first_page":"93","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9980999827384949,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7018783092498779},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6613940596580505},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6581141352653503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6425345540046692},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5463992357254028},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5280826091766357},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4286750257015228},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32010418176651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2944106459617615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2859571576118469},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.22463029623031616}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7018783092498779},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6613940596580505},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6581141352653503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6425345540046692},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5463992357254028},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5280826091766357},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4286750257015228},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32010418176651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2944106459617615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2859571576118469},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.22463029623031616},{"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":1,"locations":[{"id":"doi:10.1137/17m111835x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m111835x","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G168666529","display_name":null,"funder_award_id":"CCF-0745761","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4898802086","display_name":null,"funder_award_id":"CCF-1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6559128579","display_name":null,"funder_award_id":"CCF-1348696","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G691689332","display_name":null,"funder_award_id":"CCF-1409130","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7291707221","display_name":null,"funder_award_id":"CCF-1535972","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7767836430","display_name":null,"funder_award_id":"CCF-1008065","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1991115187","https://openalex.org/W1993134505","https://openalex.org/W1999370138","https://openalex.org/W2014008637","https://openalex.org/W2015231501","https://openalex.org/W2016663842","https://openalex.org/W2027593932","https://openalex.org/W2033961412","https://openalex.org/W2041462779","https://openalex.org/W2042276676","https://openalex.org/W2062657914","https://openalex.org/W2064467943","https://openalex.org/W2086748851","https://openalex.org/W2089269509","https://openalex.org/W2095518199","https://openalex.org/W2156867662","https://openalex.org/W2163914211","https://openalex.org/W3138991387","https://openalex.org/W4210281823"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W4390751688","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W1970915793"],"abstract_inverted_index":{"Modern":[0],"data":[1],"centers":[2],"face":[3],"a":[4,96,106,111,244,292,319],"key":[5],"challenge":[6],"of":[7,49,98,110,157],"effectively":[8],"serving":[9],"user":[10],"requests":[11,16],"that":[12,196,273,290,324],"arrive":[13],"online.":[14],"Such":[15],"are":[17,51,62],"inherently":[18],"multidimensional":[19],"and":[20,34,46,89,122,127,131,136,162,169,174,184,214,229,249,261,341],"characterized":[21],"by":[22,87,118,208,284],"demand":[23],"vectors":[24],"over":[25,144],"multiple":[26],"resources":[27,39],"such":[28],"as":[29],"processor":[30],"cycles,":[31],"storage":[32],"space,":[33],"network":[35],"bandwidth.":[36],"Typically,":[37],"different":[38,41],"require":[40],"objectives":[42,56,329],"to":[43,257,308,336,347],"be":[44],"optimized,":[45],"$L_r$":[47,132,167,266,310,328],"norms":[48,168,311],"loads":[50],"among":[52],"the":[53,59,67,78,145,154,158,172,197,238,274,305,326,331,338,343,349],"most":[54],"popular":[55],"considered.":[57],"Furthermore,":[58],"server":[60],"clusters":[61],"also":[63,255],"often":[64],"heterogeneous":[65],"making":[66],"scheduling":[68,81,94,160],"problem":[69,82,161,242],"more":[70],"challenging.":[71],"To":[72],"address":[73],"these":[74,302],"problems,":[75],"we":[76,152,194,271,317],"consider":[77],"online":[79,137,155,211,234,246,287,339],"vector":[80,93,107,159],"in":[83,91,120,170,345],"this":[84,150],"paper.":[85],"Introduced":[86],"Chekuri":[88],"Khanna":[90],"2006,":[92],"is":[95,201,226,230,278],"generalization":[97],"classical":[99],"load":[100,108],"balancing,":[101],"where":[102],"every":[103],"job":[104],"has":[105],"instead":[109],"scalar":[112,115],"load.":[113],"The":[114,223],"problem,":[116],"introduced":[117],"Graham":[119],"1966,":[121],"its":[123,163],"many":[124],"variants":[125],"(identical":[126],"unrelated":[128,175,269],"machines,":[129,193,270,299],"makespan":[130],"norm":[133],"optimization,":[134],"offline":[135],"jobs,":[138],"etc.)":[139],"have":[140],"been":[141],"extensively":[142],"studied":[143],"last":[146],"50":[147],"years.":[148],"In":[149,315],"paper,":[151],"resolve":[153],"complexity":[156],"important":[164],"generalizations---for":[165],"all":[166],"both":[171],"identical":[173,192,298],"machines":[176,183],"settings.":[177],"For":[178,191,268],"an":[179,210,215,218,233,286],"instance":[180],"with":[181,217,330],"$m$":[182],"$d$":[185],"dimensions,":[186],"our":[187],"main":[188],"results":[189],"are:":[190],"show":[195,272],"optimal":[198,275],"competitive":[199,221,276,350],"ratio":[200,277],"$\\Theta(\\log":[202,279],"d":[203],"/":[204],"\\log":[205,206,282],"d)$":[207,283],"giving":[209,285],"lower":[212,224,235,262,288],"bound":[213,225,236,289,348],"algorithm":[216,340],"asymptotically":[219,258],"matching":[220],"ratio.":[222,351],"technically":[227],"challenging,":[228],"obtained":[231],"via":[232],"for":[237,264],"minimum":[239],"monochromatic":[240],"clique":[241],"using":[243],"novel":[245],"coloring":[247],"game":[248],"randomized":[250],"coding":[251],"scheme.":[252],"Our":[253],"techniques":[254],"extend":[256],"tight":[259],"upper":[260,295,306],"bounds":[263],"general":[265,309],"norms.":[267],"m":[280],"+":[281],"matches":[291],"previously":[293],"known":[294],"bound.":[296],"Unlike":[297],"however,":[300],"extending":[301],"results,":[303],"particularly":[304],"bound,":[307],"requires":[312],"new":[313],"ideas.":[314],"particular,":[316],"use":[318],"carefully":[320],"constructed":[321],"potential":[322,346],"function":[323],"balances":[325],"individual":[327],"overall":[332],"(convexified)":[333],"min-max":[334],"objective":[335],"guide":[337],"track":[342],"changes":[344]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}