{"id":"https://openalex.org/W7116278512","doi":"https://doi.org/10.1145/3754598.3754631","title":"Solving Extended Flexible Job Shop Scheduling Problems with Deep Reinforcement Learning","display_name":"Solving Extended Flexible Job Shop Scheduling Problems with Deep Reinforcement Learning","publication_year":2025,"publication_date":"2025-09-08","ids":{"openalex":"https://openalex.org/W7116278512","doi":"https://doi.org/10.1145/3754598.3754631"},"language":null,"primary_location":{"id":"doi:10.1145/3754598.3754631","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754631","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3754598.3754631","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120922814","display_name":"Haonan Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Haonan Jiang","raw_affiliation_strings":["School of Computer Science, Nankai University, Tianjin, China"],"raw_orcid":"https://orcid.org/0009-0004-6514-3018","affiliations":[{"raw_affiliation_string":"School of Computer Science, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026498734","display_name":"Yusen Li","orcid":"https://orcid.org/0000-0001-6623-350X"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yusen Li","raw_affiliation_strings":["Nankai University, Tianjin, China"],"raw_orcid":"https://orcid.org/0000-0001-6623-350X","affiliations":[{"raw_affiliation_string":"Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088967745","display_name":"Xiaoguang LIU","orcid":null},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoguang Liu","raw_affiliation_strings":["Nankai University, Tianjin, China"],"raw_orcid":"https://orcid.org/0000-0002-9010-3278","affiliations":[{"raw_affiliation_string":"Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Gang Wang","orcid":"https://orcid.org/0000-0003-0387-2501"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gang Wang","raw_affiliation_strings":["Nankai University, Tianjin, China"],"raw_orcid":"https://orcid.org/0000-0003-0387-2501","affiliations":[{"raw_affiliation_string":"Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120896898","display_name":"Xuebo Zhang","orcid":"https://orcid.org/0000-0001-5308-6539"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuebo Zhang","raw_affiliation_strings":["Nankai University, Tianjin, China"],"raw_orcid":"https://orcid.org/0000-0001-5308-6539","affiliations":[{"raw_affiliation_string":"Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5120922814"],"corresponding_institution_ids":["https://openalex.org/I205237279"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63074866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"33","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.3677000105381012,"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.3677000105381012,"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.0957999974489212,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.057100001722574234,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.6883999705314636},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5914000272750854},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5864999890327454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41589999198913574},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.41119998693466187},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4108000099658966},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.37689998745918274},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.37220001220703125},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.36970001459121704}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7357000112533569},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6883999705314636},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5914000272750854},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5864999890327454},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.445499986410141},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4205999970436096},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41589999198913574},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.41119998693466187},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4108000099658966},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3741999864578247},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.37220001220703125},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.36970001459121704},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.3555000126361847},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3262999951839447},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.29750001430511475},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.28349998593330383},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2685999870300293},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.2653999924659729},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.2612000107765198},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3754598.3754631","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754631","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3754598.3754631","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3754598.3754631","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1976618788","https://openalex.org/W2057285547","https://openalex.org/W2129324550","https://openalex.org/W2168759311","https://openalex.org/W2791987562","https://openalex.org/W2912470722","https://openalex.org/W2932097000","https://openalex.org/W2952808052","https://openalex.org/W3009389630","https://openalex.org/W3016938688","https://openalex.org/W3110512320","https://openalex.org/W3134664017","https://openalex.org/W4226210625","https://openalex.org/W4282946405","https://openalex.org/W4285024875","https://openalex.org/W4287891029","https://openalex.org/W4380768317","https://openalex.org/W4381890811","https://openalex.org/W4386264880","https://openalex.org/W4386590783","https://openalex.org/W4387093200","https://openalex.org/W4399457238","https://openalex.org/W4403721505"],"related_works":[],"abstract_inverted_index":{"Focusing":[0],"on":[1,151],"a":[2,67,109,136,145],"distributed":[3],"aircraft":[4],"manufacturing":[5],"scenario":[6],"that":[7,155],"supports":[8],"cloud-edge":[9],"collaboration,":[10],"this":[11],"study":[12],"formulates":[13],"an":[14,54],"extended":[15],"Flexible":[16],"Job":[17],"Shop":[18],"Scheduling":[19],"Problem":[20],"(EFJSP)":[21],"incorporating":[22],"task":[23],"area":[24,76],"partitioning":[25,77],"and":[26,49,72,78,98,103,113,139,181],"cross-region":[27],"machine":[28,79,99],"travel":[29,80,104],"time":[30,170],"constraints.":[31],"The":[32],"inclusion":[33],"of":[34,40],"additional":[35],"constraints":[36],"increases":[37],"the":[38,41,62,96,116,122,130,156],"complexity":[39],"scheduling":[42],"problem.":[43],"To":[44],"ensure":[45],"both":[46],"solution":[47],"quality":[48],"computational":[50,176],"efficiency,":[51],"we":[52],"propose":[53],"end-to-end":[55],"deep":[56],"reinforcement":[57],"learning":[58],"(DRL)-based":[59],"approach.":[60],"First,":[61],"EFJSP":[63],"is":[64,88],"represented":[65],"as":[66],"disjunctive":[68],"graph":[69,84],"with":[70,121,144],"node":[71,93,123],"edge":[73],"features":[74],"capturing":[75],"time.":[81],"A":[82],"dual":[83],"attention":[85],"network":[86,141],"(DGAT)":[87],"then":[89],"employed":[90],"to":[91],"extract":[92],"embeddings":[94],"from":[95],"operation":[97],"subgraphs.":[100],"Machine":[101],"processing":[102],"times":[105],"are":[106],"unified":[107],"into":[108,115],"single":[110],"temporal":[111],"dimension":[112],"incorporated":[114],"operation-machine":[117],"features,":[118],"which,":[119],"together":[120],"embeddings,":[124],"support":[125],"high-quality":[126],"decision-making.":[127],"Finally,":[128],"under":[129],"Proximal":[131],"Policy":[132],"Optimization":[133],"(PPO)":[134],"framework,":[135],"scale-invariant":[137],"policy":[138],"value":[140],"interact":[142],"iteratively":[143],"simulation":[146],"environment":[147],"for":[148,185],"training.":[149],"Experiments":[150],"synthetic":[152],"datasets":[153],"show":[154],"proposed":[157],"method":[158],"outperforms":[159],"priority":[160],"dispatching":[161],"rules":[162],"(PDRs),":[163],"matches":[164],"or":[165],"exceeds":[166],"exact":[167,179],"methods":[168,180],"within":[169],"limits.":[171],"Additionally,":[172],"it":[173],"exhibits":[174],"superior":[175],"efficiency":[177],"over":[178],"strong":[182],"generalization":[183],"capabilities":[184],"large-scale":[186],"problems.":[187]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-21T00:00:00"}