{"id":"https://openalex.org/W7154390129","doi":"https://doi.org/10.48550/arxiv.2604.10073","title":"Graph-RHO: Critical-path-aware Heterogeneous Graph Network for Long-Horizon Flexible Job-Shop Scheduling","display_name":"Graph-RHO: Critical-path-aware Heterogeneous Graph Network for Long-Horizon Flexible Job-Shop Scheduling","publication_year":2026,"publication_date":"2026-04-11","ids":{"openalex":"https://openalex.org/W7154390129","doi":"https://doi.org/10.48550/arxiv.2604.10073"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.10073","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10073","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"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.2604.10073","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133586167","display_name":"Yujie Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Yujie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133622856","display_name":"Jiuniu Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Jiuniu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133585683","display_name":"Mugen Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peng, Mugen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133607956","display_name":"Guangzuo Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Guangzuo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5121834773","display_name":"Wenjia Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Wenjia","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.2167000025510788,"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.2167000025510788,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1412999927997589,"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.08739999681711197,"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/bottleneck","display_name":"Bottleneck","score":0.6161999702453613},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.510200023651123},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.3788999915122986},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3684999942779541},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3605000078678131},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.3127000033855438},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.3118000030517578}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7657999992370605},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6161999702453613},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.510200023651123},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3962000012397766},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3684999942779541},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3440999984741211},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3296000063419342},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3086000084877014},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30070000886917114},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C185874996","wikidata":"https://www.wikidata.org/wiki/Q269699","display_name":"Interdependence","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C87698059","wikidata":"https://www.wikidata.org/wiki/Q1808960","display_name":"LTI system theory","level":3,"score":0.2621999979019165},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C70437156","wikidata":"https://www.wikidata.org/wiki/Q7228652","display_name":"Pooling","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.10073","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10073","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.10073","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.10073","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"score":0.5548388361930847,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Long-horizon":[0],"Flexible":[1],"Job-Shop":[2],"Scheduling~(FJSP)":[3],"presents":[4],"a":[5,26,100,109,134,187],"formidable":[6],"combinatorial":[7],"challenge":[8],"due":[9],"to":[10,29,52,127,143,169],"complex,":[11],"interdependent":[12],"decisions":[13],"spanning":[14],"extended":[15],"time":[16,207],"horizons.":[17],"While":[18],"learning-based":[19],"Rolling":[20],"Horizon":[21],"Optimization~(RHO)":[22],"has":[23],"emerged":[24],"as":[25,117],"promising":[27],"paradigm":[28],"accelerate":[30],"solving":[31],"by":[32,42,208],"identifying":[33],"and":[34,57,196],"fixing":[35],"invariant":[36],"operations,":[37],"its":[38],"effectiveness":[39],"is":[40,70,223],"hindered":[41],"the":[43,59,85,174,191],"structural":[44],"complexity":[45],"of":[46,62,190],"FJSP.":[47],"Existing":[48],"methods":[49],"often":[50],"fail":[51],"capture":[53],"intricate":[54],"graph-structured":[55],"dependencies":[56],"ignore":[58],"asymmetric":[60],"costs":[61],"prediction":[63],"errors,":[64],"in":[65,81,193],"which":[66],"misclassifying":[67,75],"critical-path":[68],"operations":[69,148],"significantly":[71],"more":[72],"detrimental":[73],"than":[74],"non-critical":[76],"ones.":[77,151],"Furthermore,":[78],"dynamic":[79],"shifts":[80],"predictive":[82],"confidence":[83],"during":[84,141],"rolling":[86],"process":[87],"make":[88],"static":[89],"pruning":[90],"thresholds":[91],"inadequate.":[92],"To":[93],"address":[94],"these":[95],"limitations,":[96],"we":[97,107,132,153],"propose":[98],"Graph-RHO,":[99],"novel":[101],"critical-path-aware":[102,135],"graph-based":[103],"RHO":[104],"framework.":[105],"First,":[106],"introduce":[108],"topology-aware":[110],"heterogeneous":[111],"graph":[112],"network":[113],"that":[114,137,159,184],"encodes":[115],"subproblems":[116],"operation-machine":[118],"graphs":[119],"with":[120,173],"multi-relational":[121],"edges,":[122],"leveraging":[123],"edge-feature-aware":[124],"message":[125],"passing":[126],"predict":[128],"operation":[129],"stability.":[130],"Second,":[131],"incorporate":[133],"mechanism":[136],"injects":[138],"inductive":[139],"biases":[140],"training":[142],"distinguish":[144],"highly":[145],"sensitive":[146],"bottleneck":[147],"from":[149],"robust":[150],"Third,":[152],"devise":[154],"an":[155],"adaptive":[156],"thresholding":[157],"strategy":[158],"dynamically":[160],"calibrates":[161],"decision":[162],"boundaries":[163],"based":[164],"on":[165,180,211],"online":[166],"uncertainty":[167],"estimation":[168],"align":[170],"model":[171],"predictions":[172],"solver's":[175],"search":[176],"space.":[177],"Extensive":[178],"experiments":[179],"standard":[181],"benchmarks":[182],"demonstrate":[183],"\\mbox{Graph-RHO}":[185],"establishes":[186],"new":[188],"state":[189],"art":[192],"solution":[194,219],"quality":[195],"computational":[197],"efficiency.":[198],"Remarkably,":[199],"it":[200],"exhibits":[201],"exceptional":[202],"zero-shot":[203],"generalization,":[204],"reducing":[205],"solve":[206],"over":[209],"30\\%":[210],"large-scale":[212],"instances":[213],"(2000":[214],"operations)":[215],"while":[216],"achieving":[217],"superior":[218],"quality.":[220],"Our":[221],"code":[222],"available":[224],"\\href{https://github.com/IntelliSensing/Graph-RHO}{here}.":[225]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-15T00:00:00"}