{"id":"https://openalex.org/W7133308389","doi":"https://doi.org/10.1016/j.cor.2026.107444","title":"A neural-driven constructive heuristic for the flexible job shop scheduling problem: An efficient alternative to complex deep learning methods","display_name":"A neural-driven constructive heuristic for the flexible job shop scheduling problem: An efficient alternative to complex deep learning methods","publication_year":2026,"publication_date":"2026-03-03","ids":{"openalex":"https://openalex.org/W7133308389","doi":"https://doi.org/10.1016/j.cor.2026.107444"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2026.107444","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107444","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cor.2026.107444","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031580700","display_name":"Mariusz Kaleta","orcid":"https://orcid.org/0000-0002-2225-8956"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Mariusz Kaleta","raw_affiliation_strings":["Warsaw University of Technology, Pl. Politechniki 1, Warsaw, 00-661, Poland"],"affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, Pl. Politechniki 1, Warsaw, 00-661, Poland","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022389672","display_name":"Tomasz \u015aliwi\u0144ski","orcid":"https://orcid.org/0000-0002-5111-1830"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz \u015aliwi\u0144ski","raw_affiliation_strings":["Warsaw University of Technology, Pl. Politechniki 1, Warsaw, 00-661, Poland"],"affiliations":[{"raw_affiliation_string":"Warsaw University of Technology, Pl. Politechniki 1, Warsaw, 00-661, Poland","institution_ids":["https://openalex.org/I108403487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031580700"],"corresponding_institution_ids":["https://openalex.org/I108403487"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":{"value":3210,"currency":"USD","value_usd":3210},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.90817223,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"191","issue":null,"first_page":"107444","last_page":"107444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8845000267028809,"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.8845000267028809,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.012600000016391277,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.009200000204145908,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5841000080108643},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5702999830245972},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.517799973487854},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4767000079154968},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4733999967575073},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.46880000829696655},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.45260000228881836},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4343000054359436},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4316999912261963}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7738999724388123},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5841000080108643},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5702999830245972},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5485000014305115},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.517799973487854},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4767000079154968},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4733999967575073},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.45989999175071716},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4343000054359436},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4316999912261963},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.4293999969959259},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4115999937057495},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.39719998836517334},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3662000000476837},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.35420000553131104},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.35040000081062317},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C205555498","wikidata":"https://www.wikidata.org/wiki/Q505588","display_name":"CMA-ES","level":4,"score":0.31709998846054077},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.274399995803833},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26600000262260437},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2621999979019165},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2026.107444","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107444","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2026.107444","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2026.107444","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7340442538261414,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W1969697910","https://openalex.org/W2010890795","https://openalex.org/W2021996073","https://openalex.org/W2026541511","https://openalex.org/W2040789431","https://openalex.org/W2046437335","https://openalex.org/W2081343181","https://openalex.org/W2091642568","https://openalex.org/W2098650167","https://openalex.org/W2198739890","https://openalex.org/W2260286117","https://openalex.org/W2321430542","https://openalex.org/W2765715912","https://openalex.org/W2918688963","https://openalex.org/W2926551842","https://openalex.org/W3004986338","https://openalex.org/W3082377584","https://openalex.org/W3112096849","https://openalex.org/W3176897893","https://openalex.org/W3203365843","https://openalex.org/W3209314316","https://openalex.org/W3216717564","https://openalex.org/W4210876519","https://openalex.org/W4223536612","https://openalex.org/W4223921650","https://openalex.org/W4226210625","https://openalex.org/W4282946405","https://openalex.org/W4285024875","https://openalex.org/W4292738231","https://openalex.org/W4304481271","https://openalex.org/W4377695412","https://openalex.org/W4386590783","https://openalex.org/W4387093200","https://openalex.org/W4388823069","https://openalex.org/W4388840804","https://openalex.org/W4388932068","https://openalex.org/W4388948792","https://openalex.org/W4390368000","https://openalex.org/W4391450140","https://openalex.org/W4395682304","https://openalex.org/W4399043018","https://openalex.org/W4400680243","https://openalex.org/W4400773523","https://openalex.org/W4401503771","https://openalex.org/W4401890413","https://openalex.org/W4403482855","https://openalex.org/W4403721505","https://openalex.org/W4404126274","https://openalex.org/W4404908309","https://openalex.org/W4409201768","https://openalex.org/W4410641678","https://openalex.org/W4411011585","https://openalex.org/W4411220502"],"related_works":[],"abstract_inverted_index":{"The":[0,40,194,244],"Flexible":[1],"Job":[2],"Shop":[3],"Scheduling":[4],"Problem":[5],"(FJSP)":[6],"is":[7],"a":[8,23,35,69,92,98,169,204],"complex,":[9],"NP-hard":[10],"optimization":[11,71],"challenge":[12],"with":[13,34,240],"significant":[14],"practical":[15],"relevance":[16],"in":[17,262],"manufacturing":[18],"systems.":[19],"This":[20],"paper":[21],"introduces":[22],"novel":[24],"neural-driven":[25,215],"constructive":[26,201],"heuristic":[27,117,216,245],"that":[28],"replaces":[29],"static":[30],"priority":[31],"dispatching":[32,152],"rules":[33],"compact,":[36],"feed-forward":[37],"neural":[38,228],"network.":[39],"network":[41,112],"evaluates":[42],"potential":[43,198],"operation-machine":[44],"assignments":[45],"during":[46],"the":[47,56,65,74,82,111,116,123,137,141,149,160,197],"schedule":[48,59],"construction":[49],"process":[50],"based":[51],"on":[52,136,185,249],"features":[53],"derived":[54],"from":[55],"current":[57],"partial":[58],"and":[60,148,182,206],"job":[61,219],"state.":[62],"To":[63],"train":[64],"network,":[66],"we":[67],"employ":[68],"black-box":[70],"approach":[72,127],"using":[73,231],"Covariance":[75],"Matrix":[76],"Adaptation":[77],"Evolution":[78],"Strategy":[79],"(CMA-ES),":[80],"eliminating":[81],"need":[83],"for":[84,118,209,217],"labeled":[85],"data":[86],"or":[87,103],"reward":[88],"functions.":[89],"We":[90],"propose":[91],"two-stage":[93,235],"framework:":[94],"general":[95,238],"training":[96,239],"across":[97],"broad":[99],"range":[100],"of":[101,110,133,159,174,199,226,256],"synthetic":[102],"benchmark":[104,251],"instances,":[105],"followed":[106],"by":[107],"instance-specific":[108,241],"fine-tuning":[109],"weights":[113],"to":[114,156],"adapt":[115],"individual":[119],"problem":[120,161],"scenarios.":[121],"On":[122],"Brandimarte":[124,250],"benchmarks,":[125],"our":[126,176],"yields":[128],"an":[129],"average":[130,172],"optimality":[131],"gap":[132,173],"0.91%":[134],"(0.32%":[135],"full":[138],"dataset),":[139],"outperforming":[140],"best":[142],"deep":[143],"reinforcement":[144],"learning":[145,259],"methods":[146],"(2.35%)":[147],"leading":[150],"traditional":[151],"heuristics":[153,202],"individually":[154],"suited":[155],"each":[157],"instance":[158],"(9.25%).":[162],"Although":[163],"CPLEX":[164],"constrained":[165],"programming":[166],"solver":[167],"achieves":[168,246],"slightly":[170],"lower":[171,191],"0.05%,":[175],"method":[177],"delivers":[178],"competitive":[179],"makespans":[180,248],"overall":[181],"demonstrates":[183],"superiority":[184],"numerous":[186],"instances":[187],"at":[188],"six":[189],"times":[190],"computational":[192],"cost.":[193],"results":[195],"highlight":[196],"learning-based":[200],"as":[203],"scalable":[205],"adaptable":[207],"alternative":[208],"complex":[210],"scheduling":[211,221],"tasks.":[212],"\u2022":[213,223,233,243,253],"Novel":[214],"flexible":[218],"shop":[220],"(FJSP).":[222],"A":[224,234],"population":[225],"compact":[227],"networks":[229],"trained":[230],"CMA-ES.":[232],"framework":[236],"combining":[237],"fine-tuning.":[242],"near-optimal":[247],"tests.":[252],"Demonstrates":[254],"advantages":[255],"population-based":[257],"shallow":[258],"over":[260],"DRL":[261],"FJSP.":[263]},"counts_by_year":[],"updated_date":"2026-03-05T07:30:30.508283","created_date":"2026-03-04T00:00:00"}