{"id":"https://openalex.org/W7125853166","doi":"https://doi.org/10.3233/faia251654","title":"Curriculum-Trained Transformer for Efficient Multi-Workflow Scheduling","display_name":"Curriculum-Trained Transformer for Efficient Multi-Workflow Scheduling","publication_year":2026,"publication_date":"2026-01-27","ids":{"openalex":"https://openalex.org/W7125853166","doi":"https://doi.org/10.3233/faia251654"},"language":null,"primary_location":{"id":"doi:10.3233/faia251654","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251654","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia251654","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123950834","display_name":"Hongming Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hongming Yang","raw_affiliation_strings":["School of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China","institution_ids":["https://openalex.org/I139024713"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5123949504","display_name":"Tao Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tao Wang","raw_affiliation_strings":["School of Automation, Guangdong University of Technology, Guangzhou 510006, China"],"affiliations":[{"raw_affiliation_string":"School of Automation, Guangdong University of Technology, Guangzhou 510006, China","institution_ids":["https://openalex.org/I139024713"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123899097","display_name":"Lianglun Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I139024713","display_name":"Guangdong University of Technology","ror":"https://ror.org/04azbjn80","country_code":"CN","type":"education","lineage":["https://openalex.org/I139024713"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lianglun Cheng","raw_affiliation_strings":["School of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China","institution_ids":["https://openalex.org/I139024713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5123950834"],"corresponding_institution_ids":["https://openalex.org/I139024713"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62240982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6335999965667725,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.6335999965667725,"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.16509999334812164,"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/T11986","display_name":"Scientific Computing and Data Management","score":0.04010000079870224,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"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/workflow","display_name":"Workflow","score":0.6193000078201294},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5611000061035156},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5527999997138977},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5440000295639038},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5299999713897705},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.5288000106811523},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4260999858379364},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4059999883174896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7577000260353088},{"id":"https://openalex.org/C177212765","wikidata":"https://www.wikidata.org/wiki/Q627335","display_name":"Workflow","level":2,"score":0.6193000078201294},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5720999836921692},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5611000061035156},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5527999997138977},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5440000295639038},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5299999713897705},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.5288000106811523},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4260999858379364},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4059999883174896},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.3864000141620636},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.38449999690055847},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35440000891685486},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.349700003862381},{"id":"https://openalex.org/C112866106","wikidata":"https://www.wikidata.org/wiki/Q267053","display_name":"Lottery scheduling","level":5,"score":0.31929999589920044},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3156000077724457},{"id":"https://openalex.org/C177606310","wikidata":"https://www.wikidata.org/wiki/Q5674297","display_name":"Adaptability","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C66322947","wikidata":"https://www.wikidata.org/wiki/Q11658","display_name":"Transformer","level":3,"score":0.2865000069141388},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.28049999475479126},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.2612000107765198}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia251654","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251654","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia251654","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251654","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"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":{"With":[0],"the":[1,32,50,87,126],"growing":[2],"scale":[3],"and":[4,34,182],"complexity":[5,36,132],"of":[6,37],"batch":[7],"workflow":[8,38,93,120,187],"tasks":[9],"in":[10,103,140],"heterogeneous":[11,119],"computing":[12],"environments,":[13],"traditional":[14,154],"metaheuristic":[15],"scheduling":[16,46,65,131,165,173],"methods":[17,82],"struggle":[18],"with":[19],"high":[20],"computational":[21],"overhead.":[22],"Deep":[23],"learning-based":[24],"approaches,":[25],"while":[26,133],"promising,":[27],"remain":[28],"underexplored":[29],"due":[30],"to":[31,57,118,137,153],"irregularity":[33],"structural":[35],"data.":[39],"This":[40],"paper":[41],"proposes":[42],"a":[43,70,107,180],"deep":[44],"neural":[45],"algorithm":[47],"based":[48],"on":[49],"transformer":[51],"architecture,":[52],"leveraging":[53],"its":[54],"self-attention":[55],"mechanism":[56],"capture":[58],"cross-task":[59],"dependencies":[60],"across":[61],"multiple":[62],"workflows.":[63],"The":[64],"problem":[66],"is":[67,111],"modeled":[68],"as":[69,143,157],"sequence-to-sequence":[71],"inference":[72,150,170],"process":[73],"over":[74],"time":[75,151],"steps,":[76],"enabling":[77],"progressive":[78],"decision-making.":[79],"Unlike":[80],"conventional":[81],"that":[83,125],"require":[84],"manual":[85],"decomposition,":[86],"proposed":[88,127],"model":[89],"processes":[90],"complete":[91],"graph-structured":[92],"data":[94],"directly,":[95],"preserving":[96],"topological":[97],"information.":[98],"To":[99],"address":[100],"real-world":[101],"imbalances":[102],"task":[104,177],"size":[105],"distribution,":[106],"curriculum":[108],"learning":[109],"strategy":[110],"introduced":[112],"for":[113,163,185],"hierarchical":[114],"training,":[115],"enhancing":[116],"adaptability":[117],"clusters.":[121],"Experimental":[122],"results":[123],"show":[124],"method":[128],"significantly":[129],"reduces":[130,149],"achieving":[134],"comparable":[135],"performance":[136],"classical":[138],"metaheuristics":[139],"metrics":[141],"such":[142,156],"resource":[144],"utilization.":[145],"Moreover,":[146],"it":[147,160],"drastically":[148],"compared":[152],"approaches":[155],"PSO,":[158],"making":[159],"highly":[161],"suitable":[162],"real-time":[164],"scenarios.":[166],"Its":[167],"graph-aware":[168],"sequential":[169],"further":[171],"improves":[172],"stability":[174],"under":[175],"complex":[176],"dependencies,":[178],"offering":[179],"novel":[181],"efficient":[183],"solution":[184],"large-scale":[186],"scheduling.":[188]},"counts_by_year":[],"updated_date":"2026-01-28T23:18:48.515280","created_date":"2026-01-28T00:00:00"}