{"id":"https://openalex.org/W7162290254","doi":"https://doi.org/10.48550/arxiv.2605.23255","title":"Learning-Augmented Online Scheduling with Parsimonious Preemption","display_name":"Learning-Augmented Online Scheduling with Parsimonious Preemption","publication_year":2026,"publication_date":"2026-05-22","ids":{"openalex":"https://openalex.org/W7162290254","doi":"https://doi.org/10.48550/arxiv.2605.23255"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.23255","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23255","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.23255","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136922514","display_name":"Mugen Blue","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blue, Mugen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136963920","display_name":"Sungjin Im","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Im, Sungjin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136982678","display_name":"Alexander Lindermayr","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lindermayr, Alexander","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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.6399000287055969,"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.6399000287055969,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.1704999953508377,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.042100001126527786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/preemption","display_name":"Preemption","score":0.9485999941825867},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6399999856948853},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6086000204086304},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5313000082969666},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5163999795913696},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.398499995470047},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.34369999170303345},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.3260999917984009}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.9485999941825867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7882000207901001},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6399999856948853},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6086000204086304},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5313000082969666},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5163999795913696},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4708000123500824},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3711000084877014},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.3260999917984009},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3197999894618988},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3188999891281128},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.2973000109195709},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.2962000072002411},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2955000102519989},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.2904999852180481},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2728999853134155},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26429998874664307},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.2630999982357025}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.23255","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23255","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.23255","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.23255","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":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.6628631949424744}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Learning-augmented":[0],"algorithms":[1,89,141],"have":[2],"emerged":[3],"as":[4],"a":[5],"powerful":[6],"paradigm":[7],"to":[8,133],"surpass":[9],"traditional":[10],"worst-case":[11],"lower":[12],"bounds":[13,74],"by":[14],"integrating":[15],"potentially":[16],"noisy":[17],"predictions.":[18],"While":[19],"this":[20],"framework":[21,132],"has":[22],"seen":[23],"success":[24],"in":[25],"online":[26],"scheduling,":[27],"existing":[28],"work":[29],"primarily":[30],"optimizes":[31],"job":[32,101],"latency":[33,73],"while":[34,63],"relying":[35],"on":[36],"frequent,":[37],"``blind''":[38],"preemptions.":[39],"This":[40],"ignores":[41],"the":[42,53,69,110,115,126,130],"fundamental":[43],"trade-off":[44],"between":[45,71],"algorithmic":[46],"performance":[47],"and":[48,75,92,121,136],"preemption":[49,62,76],"complexity.":[50],"We":[51,66],"provide":[52],"first":[54,116],"systematic":[55],"study":[56],"of":[57,129],"learning-augmented":[58,131],"scheduling":[59],"that":[60,68],"curbs":[61],"optimizing":[64],"latency.":[65],"establish":[67],"gap":[70],"theoretical":[72,127],"overhead":[77,106],"can":[78],"be":[79],"bridged":[80],"with":[81,96,105,109],"solid":[82],"analytical":[83],"foundations.":[84],"Our":[85],"results":[86],"include":[87],"$O(1)$-competitive":[88],"for":[90,119],"single":[91],"unrelated":[93,120],"parallel":[94],"machines":[95],"only":[97],"$O(1)$":[98],"preemptions":[99],"per":[100],"under":[102],"accurate":[103],"predictions,":[104],"scaling":[107],"logarithmically":[108],"prediction":[111],"error.":[112],"By":[113],"providing":[114],"bounded-preemption":[117],"guarantees":[118],"malleable":[122],"machines,":[123],"we":[124],"extend":[125],"reach":[128],"more":[134],"constrained":[135],"realistic":[137],"settings.":[138],"Finally,":[139],"our":[140],"are":[142],"validated":[143],"through":[144],"experiments.":[145]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-26T00:00:00"}