{"id":"https://openalex.org/W7163163332","doi":"https://doi.org/10.48550/arxiv.2606.02029","title":"The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines","display_name":"The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7163163332","doi":"https://doi.org/10.48550/arxiv.2606.02029"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.02029","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02029","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.02029","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137667056","display_name":"Kao-Chuan Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang, Kao-Chuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137687824","display_name":"Ya-Chun Liang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liang, Ya-Chun","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.8723000288009644,"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.8723000288009644,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.07699999958276749,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.01810000091791153,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.774399995803833},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6453999876976013},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5699999928474426},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5285000205039978},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5052000284194946},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4090999960899353},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.38909998536109924},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.38830000162124634}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.774399995803833},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6453999876976013},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5699999928474426},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5285000205039978},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5052000284194946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48969998955726624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4320000112056732},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4153999984264374},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4090999960899353},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.38830000162124634},{"id":"https://openalex.org/C2780898871","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Performance metric","level":2,"score":0.38600000739097595},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.373199999332428},{"id":"https://openalex.org/C2777131613","wikidata":"https://www.wikidata.org/wiki/Q18394147","display_name":"Retard","level":2,"score":0.35989999771118164},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C87007009","wikidata":"https://www.wikidata.org/wiki/Q210832","display_name":"Statistical hypothesis testing","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31949999928474426},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27140000462532043},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.02029","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02029","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.02029","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.02029","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5864812135696411}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"online":[2],"scheduling":[3],"with":[4,11,190],"obligatory":[5],"testing":[6,131],"on":[7,150],"$m$":[8],"identical":[9],"machines":[10],"the":[12,16,38,72,75,115,130,151,160],"objective":[13,84],"of":[14,18,173],"minimizing":[15],"sum":[17],"completion":[19,153],"times.":[20,199],"In":[21],"this":[22,66,83,120,156],"model,":[23],"every":[24,123],"job":[25,125],"must":[26,126],"undergo":[27],"a":[28,90,170,176,191],"test":[29,198],"before":[30],"its":[31],"actual":[32],"processing":[33,61],"time":[34],"is":[35,42,106],"revealed.":[36],"Consequently,":[37],"central":[39],"algorithmic":[40],"challenge":[41],"no":[43],"longer":[44],"whether":[45],"to":[46,51],"acquire":[47],"information,":[48],"but":[49],"how":[50],"optimally":[52],"balance":[53],"machine":[54,92],"capacity":[55],"between":[56],"revealing":[57],"unknown":[58],"jobs":[59],"and":[60,175],"currently":[62],"known":[63],"ones.":[64],"While":[65],"tradeoff":[67],"becomes":[68],"structurally":[69],"richer":[70],"in":[71,93],"multiple-machine":[73],"setting,":[74],"only":[76],"prior":[77],"explicit":[78],"deterministic":[79,163,192],"lower":[80,148,164],"bound":[81,172],"for":[82,89,119,166,196],"was":[85],"$\\sqrt{2}$,":[86],"established":[87],"strictly":[88],"single":[91],"2024":[94],"by":[95],"Dogeas":[96],"et":[97],"al.":[98],"[ESA":[99],"2024:":[100],"48:1-48:14].":[101],"Our":[102],"core":[103],"conceptual":[104],"contribution":[105],"demonstrating":[107],"that":[108,180],"completion-threshold":[109],"quantities,":[110],"denoted":[111],"$T_X$,":[112],"serve":[113],"as":[114],"fundamental":[116],"analytical":[117],"metric":[118],"setting.":[121],"Because":[122],"completed":[124],"first":[127,161],"pass":[128],"through":[129],"phase,":[132],"delayed":[133,137],"revelation":[134],"inherently":[135],"forces":[136],"completion.":[138],"By":[139],"bounding":[140],"these":[141,187],"$T_X$":[142],"thresholds,":[143],"we":[144,158,185],"systematically":[145],"derive":[146],"strong":[147],"bounds":[149,165],"total":[152],"time.":[154],"Utilizing":[155],"framework,":[157],"establish":[159],"substantial":[162],"multiple":[167],"machines,":[168],"including":[169],"three-type":[171],"$1.4811$":[174],"multi-type":[177],"dyadic":[178],"construction":[179],"asymptotically":[181],"approaches":[182],"$3/2$.":[183],"Finally,":[184],"complement":[186],"theoretical":[188],"limits":[189],"$2$-competitive":[193],"list-scheduling":[194],"algorithm":[195],"arbitrary":[197]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-03T00:00:00"}