{"id":"https://openalex.org/W4393254992","doi":"https://doi.org/10.3390/a17040142","title":"Dynamic Events in the Flexible Job-Shop Scheduling Problem: Rescheduling with a Hybrid Metaheuristic Algorithm","display_name":"Dynamic Events in the Flexible Job-Shop Scheduling Problem: Rescheduling with a Hybrid Metaheuristic Algorithm","publication_year":2024,"publication_date":"2024-03-28","ids":{"openalex":"https://openalex.org/W4393254992","doi":"https://doi.org/10.3390/a17040142"},"language":"en","primary_location":{"id":"doi:10.3390/a17040142","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040142","pdf_url":"https://www.mdpi.com/1999-4893/17/4/142/pdf?version=1711642288","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/4/142/pdf?version=1711642288","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5094266319","display_name":"Shubhendu Kshitij Fuladi","orcid":"https://orcid.org/0009-0000-4430-5699"},"institutions":[{"id":"https://openalex.org/I8991828","display_name":"Pukyong National University","ror":"https://ror.org/0433kqc49","country_code":"KR","type":"education","lineage":["https://openalex.org/I8991828"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Shubhendu Kshitij Fuladi","raw_affiliation_strings":["Department of Information Systems, Pukyong National University, Busan 608737, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0000-4430-5699","affiliations":[{"raw_affiliation_string":"Department of Information Systems, Pukyong National University, Busan 608737, Republic of Korea","institution_ids":["https://openalex.org/I8991828"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100728871","display_name":"Chang Soo Kim","orcid":"https://orcid.org/0000-0003-2168-7983"},"institutions":[{"id":"https://openalex.org/I8991828","display_name":"Pukyong National University","ror":"https://ror.org/0433kqc49","country_code":"KR","type":"education","lineage":["https://openalex.org/I8991828"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Chang-Soo Kim","raw_affiliation_strings":["Department of Information Systems, Pukyong National University, Busan 608737, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0003-2168-7983","affiliations":[{"raw_affiliation_string":"Department of Information Systems, Pukyong National University, Busan 608737, Republic of Korea","institution_ids":["https://openalex.org/I8991828"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100728871"],"corresponding_institution_ids":["https://openalex.org/I8991828"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":7.2787,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.97608734,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"17","issue":"4","first_page":"142","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9958999752998352,"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.9958999752998352,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9646999835968018,"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/T12288","display_name":"Optimization and Search Problems","score":0.9430999755859375,"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/metaheuristic","display_name":"Metaheuristic","score":0.7194201946258545},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6859062910079956},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6635916829109192},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5468189716339111},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5152164101600647},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49889087677001953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49326223134994507},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.4548930525779724},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4263465404510498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20843875408172607},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.05068710446357727}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7194201946258545},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6859062910079956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6635916829109192},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5468189716339111},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5152164101600647},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49889087677001953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49326223134994507},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.4548930525779724},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4263465404510498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20843875408172607},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.05068710446357727},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a17040142","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040142","pdf_url":"https://www.mdpi.com/1999-4893/17/4/142/pdf?version=1711642288","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9f0443c7513a493ca04f2bd79663440a","is_oa":true,"landing_page_url":"https://doaj.org/article/9f0443c7513a493ca04f2bd79663440a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 4, p 142 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17040142","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17040142","pdf_url":"https://www.mdpi.com/1999-4893/17/4/142/pdf?version=1711642288","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G5211132112","display_name":null,"funder_award_id":"2021R1I1A3052605","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4393254992.pdf"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W2004436468","https://openalex.org/W2018179003","https://openalex.org/W2024966195","https://openalex.org/W2029501112","https://openalex.org/W2045502230","https://openalex.org/W2048380783","https://openalex.org/W2048490243","https://openalex.org/W2057285547","https://openalex.org/W2076716919","https://openalex.org/W2122736695","https://openalex.org/W2157846217","https://openalex.org/W2260286117","https://openalex.org/W2305203104","https://openalex.org/W2420894171","https://openalex.org/W2738975253","https://openalex.org/W2791336582","https://openalex.org/W2801958016","https://openalex.org/W2808148498","https://openalex.org/W2892385368","https://openalex.org/W2903917088","https://openalex.org/W2912308641","https://openalex.org/W2941722570","https://openalex.org/W2967488166","https://openalex.org/W3011707683","https://openalex.org/W3048767761","https://openalex.org/W3092208345","https://openalex.org/W3092878571","https://openalex.org/W3157200701","https://openalex.org/W3166811342","https://openalex.org/W3174408439","https://openalex.org/W3200952508","https://openalex.org/W3217690942","https://openalex.org/W4291000397","https://openalex.org/W4292738231","https://openalex.org/W4296935009","https://openalex.org/W4315786346","https://openalex.org/W4391175216","https://openalex.org/W4391677279"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W26892725","https://openalex.org/W2559484340","https://openalex.org/W2165758382","https://openalex.org/W2146297781","https://openalex.org/W2612484291"],"abstract_inverted_index":{"In":[0,36],"the":[1,37,47,64,113,115,131,142,145,150,157,191,201,204,227,232,239,243],"real":[2],"world":[3],"of":[4,21,144,162,171,203],"manufacturing":[5,16],"systems,":[6],"production":[7],"planning":[8],"is":[9,24,43,101,119,174],"crucial":[10],"for":[11,29,103],"organizing":[12],"and":[13,33,54,89,135,186,221,238],"optimizing":[14],"various":[15],"process":[17],"components.":[18],"The":[19,168],"objective":[20,170],"this":[22,108,172],"paper":[23],"to":[25,45,86,125,140,175],"present":[26],"a":[27,40,69,74,81,122,196,210,214,249],"methodology":[28],"both":[30,183],"static":[31,48],"scheduling":[32,51,58,178],"dynamic":[34,55,177,206],"scheduling.":[35],"proposed":[38,116,132,146,151,192,228,240],"method,":[39],"hybrid":[41,109,117,133,152,193,229],"algorithm":[42,62,66,78,110,118,134,153,194,230],"utilized":[44,102],"optimize":[46],"flexible":[49,56],"job-shop":[50,57],"problem":[52,59],"(FJSP)":[53],"(DFJSP).":[60],"This":[61],"integrates":[63],"genetic":[65],"(GA)":[67],"as":[68,80,209],"global":[70],"optimization":[71,84],"technique":[72],"with":[73,159,195,231],"simulated":[75,120],"annealing":[76],"(SA)":[77],"serving":[79],"local":[82,94],"search":[83,99,106],"approach":[85],"accelerate":[87],"convergence":[88],"prevent":[90],"getting":[91],"stuck":[92],"in":[93,248,252],"minima.":[95],"Additionally,":[96],"variable":[97],"neighborhood":[98,105],"(VNS)":[100],"efficient":[104],"within":[107],"framework.":[111],"For":[112],"FJSP,":[114,158],"on":[121,179],"40-benchmark":[123],"dataset":[124],"evaluate":[126],"its":[127],"performance.":[128],"Comparisons":[129],"among":[130],"other":[136],"algorithms":[137],"are":[138],"provided":[139],"show":[141],"effectiveness":[143],"algorithm,":[147],"ensuring":[148],"that":[149,226],"can":[154],"efficiently":[155],"solve":[156],"38":[160],"out":[161],"40":[163],"instances":[164],"demonstrating":[165],"better":[166],"results.":[167],"primary":[169],"study":[173],"perform":[176],"two":[180],"datasets,":[181,189],"including":[182],"single-purpose":[184],"machine":[185,188,212,219],"multi-purpose":[187],"using":[190],"rescheduling":[197,233],"strategy.":[198],"By":[199],"observing":[200],"results":[202],"DFJSP,":[205],"events":[207],"such":[208],"single":[211,215],"breakdown,":[213],"job":[216,223],"arrival,":[217],"multiple":[218,222],"breakdowns,":[220],"arrivals":[224],"demonstrate":[225],"strategy":[234],"achieves":[235],"significant":[236,250],"improvement":[237],"method":[241],"obtains":[242],"best":[244],"new":[245],"solution,":[246],"resulting":[247],"decrease":[251],"makespan.":[253]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":7}],"updated_date":"2026-07-17T09:13:05.818461","created_date":"2025-10-10T00:00:00"}