{"id":"https://openalex.org/W7163909654","doi":"https://doi.org/10.48550/arxiv.2606.06681","title":"Online Span Minimization for Flexible Uniform Jobs","display_name":"Online Span Minimization for Flexible Uniform Jobs","publication_year":2026,"publication_date":"2026-06-04","ids":{"openalex":"https://openalex.org/W7163909654","doi":"https://doi.org/10.48550/arxiv.2606.06681"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.06681","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.06681","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.06681","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075835633","display_name":"Mozhengfu Liu","orcid":"https://orcid.org/0000-0001-6181-9958"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Mozhengfu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khuller, Samir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137672740","display_name":"Xueyan Tang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tang, Xueyan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.7702999711036682,"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.7702999711036682,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.07259999960660934,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.03370000049471855,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.7148000001907349},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6920999884605408},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6834999918937683},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6146000027656555},{"id":"https://openalex.org/keywords/span","display_name":"Span (engineering)","score":0.6018999814987183},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5552999973297119},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5324000120162964},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.515999972820282}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7148000001907349},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6920999884605408},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6834999918937683},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6146000027656555},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.6018999814987183},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5641999840736389},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5552999973297119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5351999998092651},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5324000120162964},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.515999972820282},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4767000079154968},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C2988516024","wikidata":"https://www.wikidata.org/wiki/Q441195","display_name":"Life span","level":2,"score":0.30230000615119934},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3010999858379364},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29660001397132874},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.28049999475479126},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.2623000144958496}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.06681","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.06681","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.06681","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.06681","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,32,170],"the":[2,20,25,48,53,58,64,105,109,124,139,172,186,197],"critical":[3],"need":[4],"for":[5,81,98,104],"energy-efficient":[6],"scheduling":[7,89],"in":[8,86,203],"cloud":[9],"computing,":[10],"this":[11,119],"paper":[12],"investigates":[13],"Span":[14,61],"Minimization,":[15],"a":[16,73,78,95,102,151,160],"fundamental":[17],"variant":[18],"of":[19,44,57,67,112,127,144,156,163,199],"well-studied":[21],"BusyTime":[22,27,107],"problem.":[23],"In":[24,118],"general":[26,106],"problem,":[28,108],"$n$":[29],"jobs":[30,100],"characterized":[31],"release":[33],"times,":[34],"deadlines,":[35],"and":[36,101,159,201],"processing":[37],"times":[38],"must":[39],"be":[40,135],"partitioned":[41],"into":[42,196],"bundles":[43],"capacity":[45,69],"$B$,":[46],"where":[47],"objective":[49],"is":[50],"to":[51,137,174,185],"minimize":[52],"total":[54],"active":[55],"duration":[56],"virtual":[59],"machines.":[60],"minimization":[62,114],"addresses":[63],"specific":[65],"case":[66],"unbounded":[68],"($B":[70],"=":[71],"\\infty$),":[72],"problem":[74],"that":[75,132,169],"serves":[76],"as":[77],"vital":[79],"precursor":[80],"achieving":[82],"high-performance":[83],"approximation":[84],"guarantees":[85],"more":[87],"complex":[88],"environments.":[90],"While":[91],"previous":[92],"research":[93],"established":[94],"deterministic":[96,141],"$2$-approximation":[97],"interval":[99],"$3$-approximation":[103],"online":[110,125,204],"landscape":[111],"span":[113,128],"remains":[115],"less":[116],"explored.":[117],"paper,":[120],"we":[121,149,167,177],"focus":[122],"on":[123],"version":[126],"minimization.":[129],"We":[130],"demonstrate":[131],"randomization":[133,200],"can":[134,178],"leveraged":[136],"break":[138],"known":[140],"competitive":[142,153,182],"barrier":[143],"$2$.":[145],"For":[146],"uniform-length":[147],"jobs,":[148,176],"derive":[150],"randomized":[152],"upper":[154],"bound":[155,162],"$\\frac{1}{\\ln{2}}\\approx":[157],"1.443$":[158],"lower":[161],"$\\frac{\\sqrt{3}+1}{2}\\approx":[164],"1.366$.":[165],"Furthermore,":[166],"show":[168],"introducing":[171],"ability":[173],"restart":[175],"achieve":[179],"an":[180],"optimal":[181],"ratio":[183,188],"equal":[184],"golden":[187],"($\u03d5\\approx":[189],"1.618$).":[190],"Our":[191],"results":[192],"provide":[193],"new":[194],"insights":[195],"power":[198],"flexibility":[202],"energy-aware":[205],"scheduling.":[206]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-09T00:00:00"}