{"id":"https://openalex.org/W7155431890","doi":"https://doi.org/10.31449/inf.v50i11.12435","title":"A Hierarchical Attention-Based Heterogeneous Multi-Agent PPO Framework for Distributed Warehouse Scheduling","display_name":"A Hierarchical Attention-Based Heterogeneous Multi-Agent PPO Framework for Distributed Warehouse Scheduling","publication_year":2026,"publication_date":"2026-04-23","ids":{"openalex":"https://openalex.org/W7155431890","doi":"https://doi.org/10.31449/inf.v50i11.12435"},"language":null,"primary_location":{"id":"doi:10.31449/inf.v50i11.12435","is_oa":true,"landing_page_url":"https://doi.org/10.31449/inf.v50i11.12435","pdf_url":"https://www.informatica.si/index.php/informatica/article/download/12435/6656","source":{"id":"https://openalex.org/S4210173311","display_name":"Informatica","issn_l":"0350-5596","issn":["0350-5596","1854-3871"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314525","host_organization_name":"Slovenian Society Informatika","host_organization_lineage":["https://openalex.org/P4310314525"],"host_organization_lineage_names":["Slovenian Society Informatika"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Informatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.informatica.si/index.php/informatica/article/download/12435/6656","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134368640","display_name":"Yuzhang Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210120389","display_name":"Fujian Polytechnic of Information Technology","ror":"https://ror.org/02j5qn328","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210120389"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuzhang Huang","raw_affiliation_strings":["School of Business, Fuzhou Polytechnic Institute, Fuzhou, 350108, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Business, Fuzhou Polytechnic Institute, Fuzhou, 350108, China","institution_ids":["https://openalex.org/I4210120389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5134368640"],"corresponding_institution_ids":["https://openalex.org/I4210120389"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71772253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"50","issue":"11","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.6563000082969666,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.6563000082969666,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.10090000182390213,"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.04809999838471413,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6177999973297119},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5192000269889832},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4253000020980835},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.39640000462532043},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.3418000042438507},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.34040001034736633},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.33980000019073486},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.32420000433921814}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7664999961853027},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6421999931335449},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6177999973297119},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5192000269889832},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4253000020980835},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.39640000462532043},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.357699990272522},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.34040001034736633},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C123657996","wikidata":"https://www.wikidata.org/wiki/Q12271","display_name":"Architecture","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3215000033378601},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.2775999903678894},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.25609999895095825},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2540999948978424},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.25220000743865967},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.31449/inf.v50i11.12435","is_oa":true,"landing_page_url":"https://doi.org/10.31449/inf.v50i11.12435","pdf_url":"https://www.informatica.si/index.php/informatica/article/download/12435/6656","source":{"id":"https://openalex.org/S4210173311","display_name":"Informatica","issn_l":"0350-5596","issn":["0350-5596","1854-3871"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314525","host_organization_name":"Slovenian Society Informatika","host_organization_lineage":["https://openalex.org/P4310314525"],"host_organization_lineage_names":["Slovenian Society Informatika"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Informatica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.31449/inf.v50i11.12435","is_oa":true,"landing_page_url":"https://doi.org/10.31449/inf.v50i11.12435","pdf_url":"https://www.informatica.si/index.php/informatica/article/download/12435/6656","source":{"id":"https://openalex.org/S4210173311","display_name":"Informatica","issn_l":"0350-5596","issn":["0350-5596","1854-3871"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314525","host_organization_name":"Slovenian Society Informatika","host_organization_lineage":["https://openalex.org/P4310314525"],"host_organization_lineage_names":["Slovenian Society Informatika"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Informatica","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.7844986319541931,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7155431890.pdf","grobid_xml":"https://content.openalex.org/works/W7155431890.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"dynamic":[1,57,88],"changes":[2],"in":[3,100,193],"the":[4,7,13,27,63,95,122,135,149,164,183,187,204],"warehousing":[5,70],"environment,":[6],"heterogeneity":[8],"of":[9,15,29,68,125,172,189],"task":[10,79,137],"allocation,":[11],"and":[12,56,83,86,98,107,148,186],"complexity":[14],"multi-agent":[16,37,190],"collaboration":[17],"make":[18],"it":[19],"difficult":[20],"for":[21,169],"traditional":[22,119],"scheduling":[23,39,120],"algorithms":[24],"to":[25,61,93,133,145,158,200],"meet":[26],"challenges":[28],"modern":[30],"warehousing.":[31],"This":[32],"study":[33],"proposes":[34],"a":[35,52,74,87],"heterogeneous":[36],"collaborative":[38,127],"method":[40],"based":[41],"on":[42],"an":[43],"improved":[44],"Proximal":[45],"Policy":[46],"Optimization":[47],"(PPO)":[48],"framework,":[49],"which":[50,176,202],"integrates":[51],"hierarchical":[53],"attention-driven":[54],"architecture":[55],"variance":[58],"constraint":[59,66],"algorithm":[60],"address":[62],"spatio-temporal":[64],"coupling":[65],"problem":[67],"distributed":[69],"scheduling.":[71],"We":[72],"designed":[73],"multi-objective":[75],"reward":[76],"function":[77],"(considering":[78],"timeliness,":[80],"energy":[81],"consumption,":[82],"space":[84,151],"utilization)":[85],"computing":[89],"resource":[90,209],"allocation":[91],"strategy":[92],"enhance":[94],"system\u2019s":[96],"efficiency":[97],"robustness":[99],"handling":[101],"large-scale":[102],"orders":[103],"(500+":[104],"daily":[105],"orders)":[106],"unexpected":[108],"situations":[109],"(e.g.,":[110],"equipment":[111],"failure).":[112],"Experimental":[113],"data":[114],"shows":[115],"that":[116],"compared":[117],"with":[118],"algorithms,":[121],"completion":[123],"rate":[124,153,168],"agent":[126],"tasks":[128],"has":[129,140,154,196],"increased":[130,155],"from":[131,142,156,198],"56.89%":[132],"73.24%,":[134],"average":[136],"execution":[138],"delay":[139],"dropped":[141,197],"22.1":[143],"seconds":[144],"15.67":[146],"seconds,":[147],"storage":[150],"utilization":[152],"49.2%":[157],"63.5%.":[159],"In":[160],"complex":[161],"order":[162],"scenarios,":[163],"framework's":[165],"sorting":[166],"accuracy":[167],"multiple":[170],"types":[171],"goods":[173],"reaches":[174],"94.5%,":[175],"is":[177],"37.67":[178],"percentage":[179],"points":[180],"higher":[181],"than":[182],"baseline":[184],"model,":[185],"proportion":[188],"communication":[191],"overhead":[192],"system":[194],"resources":[195],"88.76%":[199],"63.5%,":[201],"verifies":[203],"algorithm's":[205],"optimization":[206],"capabilities":[207],"under":[208],"constraints.":[210]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-04-24T00:00:00"}