{"id":"https://openalex.org/W7162670749","doi":"https://doi.org/10.48550/arxiv.2605.27566","title":"DynaSchedBench: Calibrated Dynamic Scheduling Benchmarks and Observability Paradox in LLM-based Scheduling Agents","display_name":"DynaSchedBench: Calibrated Dynamic Scheduling Benchmarks and Observability Paradox in LLM-based Scheduling Agents","publication_year":2026,"publication_date":"2026-05-26","ids":{"openalex":"https://openalex.org/W7162670749","doi":"https://doi.org/10.48550/arxiv.2605.27566"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.27566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27566","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.2605.27566","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101401413","display_name":"Shijie Cao","orcid":"https://orcid.org/0000-0002-5646-2947"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cao, Shijie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137237860","display_name":"Yuan Yuan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yuan, Yuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137248032","display_name":"Jing Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Jing","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.43209999799728394,"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.43209999799728394,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.164000004529953,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.03819999843835831,"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/observability","display_name":"Observability","score":0.5392000079154968},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5224000215530396},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4814999997615814},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.4618000090122223},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41620001196861267},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.40860000252723694},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.39500001072883606},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.37709999084472656}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7587000131607056},{"id":"https://openalex.org/C36299963","wikidata":"https://www.wikidata.org/wiki/Q1369844","display_name":"Observability","level":2,"score":0.5392000079154968},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5224000215530396},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4814999997615814},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.4618000090122223},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41620001196861267},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41269999742507935},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.40860000252723694},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.37689998745918274},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3675000071525574},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.30640000104904175},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2572000026702881}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.27566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27566","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.2605.27566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.27566","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":{"Progress":[0],"in":[1,132],"neural":[2],"combinatorial":[3],"optimization":[4],"for":[5,43,101,136],"Dynamic":[6],"Flexible":[7],"Job":[8],"Shop":[9],"Scheduling":[10],"Problem":[11],"(DFJSP)":[12],"is":[13,81],"currently":[14],"hindered":[15],"by":[16,75],"a":[17,40,66],"methodological":[18],"tension:":[19],"static":[20],"benchmarks":[21],"encourage":[22],"benchmark":[23],"overfitting,":[24],"while":[25,89],"uncalibrated":[26],"generators":[27],"obscure":[28],"algorithmic":[29],"capability":[30],"with":[31,146],"stochastic":[32],"noise.":[33],"To":[34],"resolve":[35],"this,":[36],"we":[37,123,139],"introduce":[38],"\\textbf{DynaSchedBench},":[39],"diagnostic":[41],"framework":[42,97],"DFJSP":[44],"that":[45,64,79],"rigorously":[46],"controls":[47],"the":[48,93],"instance-generation":[49],"process.":[50],"Instead":[51],"of":[52,114,127],"relying":[53],"on":[54],"parameter":[55],"sampling,":[56],"our":[57],"approach":[58],"utilizes":[59],"Sequential":[60],"Event-Space":[61],"Calibrator":[62],"(SESC)":[63],"computes":[65],"novel":[67],"Schedule":[68],"Stress":[69],"Index":[70],"(SSI)":[71],"to":[72,92,149,170,179],"stratify":[73],"instances":[74],"difficulty.":[76],"We":[77],"demonstrate":[78],"SESC":[80],"substantially":[82],"more":[83,185],"computationally":[84],"efficient":[85],"than":[86,190],"evolutionary":[87],"baselines":[88],"converging":[90],"reliably":[91,171],"target":[94],"metrics.":[95],"The":[96],"integrates":[98],"modular":[99],"components":[100],"instance":[102],"generation,":[103],"snapshot-based":[104],"simulation,":[105],"agents,":[106],"evaluation,":[107],"and":[108,116,166,174],"visualization,":[109],"thereby":[110],"enabling":[111],"rigorous":[112],"testing":[113],"reactive":[115],"lookahead-based":[117],"policies.":[118],"Leveraging":[119],"this":[120],"calibrated":[121],"environment,":[122],"identify":[124,140],"key":[125],"limitations":[126],"LLM-based":[128],"scheduling":[129],"agents.":[130],"Specifically,":[131],"step-wise":[133],"online":[134],"decision-making":[135],"dynamic":[137],"scheduling,":[138],"an":[141],"``Observability":[142],"Paradox'':":[143],"providing":[144],"agents":[145,177],"oracle":[147],"access":[148],"full":[150],"structural":[151],"information":[152],"can":[153],"degrade":[154],"policy":[155],"performance,":[156,173],"underperforming":[157],"concise":[158],"information.":[159],"Furthermore,":[160],"despite":[161],"substantial":[162],"token":[163],"overhead,":[164],"tool-augmented":[165],"refinement":[167],"strategies":[168],"fail":[169,178],"improve":[172],"most":[175],"LLM":[176],"consistently":[180],"surpass":[181],"strong":[182],"dispatching":[183],"baselines-behaving":[184],"like":[186],"robust":[187],"heuristic":[188],"approximators":[189],"superior":[191],"optimizers.":[192]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-29T00:00:00"}