{"id":"https://openalex.org/W4410342856","doi":"https://doi.org/10.1109/access.2025.3569568","title":"Multi-Agent Communication for Dynamic Job-Shop Scheduling: A Robust Single-Machine Scheduling Model With Genetic Algorithm Optimization","display_name":"Multi-Agent Communication for Dynamic Job-Shop Scheduling: A Robust Single-Machine Scheduling Model With Genetic Algorithm Optimization","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4410342856","doi":"https://doi.org/10.1109/access.2025.3569568"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3569568","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3569568","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3569568","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003348404","display_name":"Hong-Phuc Nguyen","orcid":"https://orcid.org/0000-0002-3070-3650"},"institutions":[{"id":"https://openalex.org/I177733328","display_name":"Can Tho University","ror":"https://ror.org/0071qz696","country_code":"VN","type":"education","lineage":["https://openalex.org/I177733328"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Hong-Phuc Nguyen","raw_affiliation_strings":["Faculty of Industrial Management, Can Tho University, Can Tho, Vietnam","Faculty of Industrial Management, Can Tho University, Can Tho City, Viet Nam"],"raw_orcid":"https://orcid.org/0000-0002-3070-3650","affiliations":[{"raw_affiliation_string":"Faculty of Industrial Management, Can Tho University, Can Tho, Vietnam","institution_ids":["https://openalex.org/I177733328"]},{"raw_affiliation_string":"Faculty of Industrial Management, Can Tho University, Can Tho City, Viet Nam","institution_ids":["https://openalex.org/I177733328"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003690110","display_name":"Quang Hieu Ngo","orcid":"https://orcid.org/0000-0002-7537-9049"},"institutions":[{"id":"https://openalex.org/I177733328","display_name":"Can Tho University","ror":"https://ror.org/0071qz696","country_code":"VN","type":"education","lineage":["https://openalex.org/I177733328"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Quang-Hieu Ngo","raw_affiliation_strings":["Faculty of Mechanical Engineering, Can Tho University, Can Tho, Vietnam","Faculty of Mechanical Engineering, Can Tho University, Can Tho City, Viet Nam"],"raw_orcid":"https://orcid.org/0000-0002-7537-9049","affiliations":[{"raw_affiliation_string":"Faculty of Mechanical Engineering, Can Tho University, Can Tho, Vietnam","institution_ids":["https://openalex.org/I177733328"]},{"raw_affiliation_string":"Faculty of Mechanical Engineering, Can Tho University, Can Tho City, Viet Nam","institution_ids":["https://openalex.org/I177733328"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067090714","display_name":"Van\u2010Can Nguyen","orcid":"https://orcid.org/0000-0003-0087-1087"},"institutions":[{"id":"https://openalex.org/I177733328","display_name":"Can Tho University","ror":"https://ror.org/0071qz696","country_code":"VN","type":"education","lineage":["https://openalex.org/I177733328"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"van-Can Nguyen","raw_affiliation_strings":["Faculty of Industrial Management, Can Tho University, Can Tho, Vietnam","Faculty of Industrial Management, Can Tho University, Can Tho City, Viet Nam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Industrial Management, Can Tho University, Can Tho, Vietnam","institution_ids":["https://openalex.org/I177733328"]},{"raw_affiliation_string":"Faculty of Industrial Management, Can Tho University, Can Tho City, Viet Nam","institution_ids":["https://openalex.org/I177733328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I177733328"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.7777,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.72858688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"13","issue":null,"first_page":"87183","last_page":"87192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9955000281333923,"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.9955000281333923,"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.9284999966621399,"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/computer-science","display_name":"Computer science","score":0.7731375694274902},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6667805910110474},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.592036783695221},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5725897550582886},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.572493314743042},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5113832354545593},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48975253105163574},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47908860445022583},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43938177824020386},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.4224138855934143},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4141163229942322},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37123924493789673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3383418321609497},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.13901197910308838},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07846909761428833},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.0628649890422821},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.055050790309906006}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7731375694274902},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6667805910110474},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.592036783695221},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5725897550582886},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.572493314743042},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5113832354545593},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48975253105163574},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47908860445022583},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43938177824020386},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.4224138855934143},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4141163229942322},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37123924493789673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3383418321609497},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.13901197910308838},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07846909761428833},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0628649890422821},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.055050790309906006}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3569568","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3569568","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:79549e4ce6c645f7bd31a8ba38ab1682","is_oa":true,"landing_page_url":"https://doaj.org/article/79549e4ce6c645f7bd31a8ba38ab1682","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":"IEEE Access, Vol 13, Pp 87183-87192 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3569568","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3569568","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1486220945","https://openalex.org/W1659842140","https://openalex.org/W1992503654","https://openalex.org/W1992820628","https://openalex.org/W2047191259","https://openalex.org/W2073701432","https://openalex.org/W2516034117","https://openalex.org/W2567724131","https://openalex.org/W2747092504","https://openalex.org/W2785339424","https://openalex.org/W2944529629","https://openalex.org/W2971108084","https://openalex.org/W2980397845","https://openalex.org/W2992936127","https://openalex.org/W3113806582","https://openalex.org/W3156138784","https://openalex.org/W4390917519","https://openalex.org/W6638652084"],"related_works":["https://openalex.org/W2741059494","https://openalex.org/W32630872","https://openalex.org/W2365679959","https://openalex.org/W2949165180","https://openalex.org/W2155809154","https://openalex.org/W2838819579","https://openalex.org/W4387445197","https://openalex.org/W131757205","https://openalex.org/W2057737420","https://openalex.org/W2596081411"],"abstract_inverted_index":{"Job-shop":[0],"scheduling":[1,18,44,142,180,211],"is":[2,55,158,174,236],"crucial":[3],"in":[4,30,239],"manufacturing":[5],"systems":[6],"but":[7],"struggles":[8],"with":[9,63],"uncertainties":[10],"like":[11],"random":[12],"job":[13,74,98,186,220],"arrivals":[14],"and":[15,25,78,86,111,164,216,224],"disruptions.":[16],"Traditional":[17],"methods":[19],"often":[20],"rely":[21],"on":[22,41,128],"centralized":[23],"control":[24],"predefined":[26],"rules,":[27],"limiting":[28],"flexibility":[29],"dynamic":[31,47],"environments.":[32,242],"This":[33],"study":[34],"has":[35],"proposed":[36,104,196,205,229],"a":[37,68,184],"multi-agent":[38,185],"communication":[39,105,197],"based":[40],"the":[42,108,116,123,129,140,162,178,195,204,208,228],"single-machine":[43,141,179,210],"model":[45,212],"for":[46],"job-shop":[48,241],"scheduling.":[49],"In":[50],"this":[51],"model,":[52,143],"each":[53],"machine":[54],"considered":[56],"an":[57,82,159],"autonomous":[58],"agent":[59,83,110,125,134],"who":[60],"can":[61,126],"communicate":[62],"other":[64,112],"agents":[65,113],"to":[66,94,114,146,176,193],"produce":[67],"robust":[69],"local":[70,120,137,148],"schedule":[71],"against":[72],"uncertain":[73,219],"arrivals,":[75,221],"processing":[76,222],"times,":[77,223],"disruptive":[79,225],"events.":[80,226],"When":[81],"becomes":[84],"idle,":[85],"its":[87,136],"queue":[88,138],"length":[89],"exceeds":[90],"1,":[91],"it":[92],"needs":[93],"decide":[95,127],"which":[96,144,235],"waiting":[97],"should":[99],"be":[100,191],"processed":[101,131],"next.":[102],"The":[103,171,199],"process":[106],"allows":[107],"decision-making":[109,124],"exchange":[115],"intention":[117],"of":[118,167],"their":[119],"schedules.":[121],"Accordingly,":[122],"next":[130],"job.":[132],"Each":[133],"schedules":[135],"using":[139],"aims":[145],"reduce":[147],"tardiness":[149,217],"costs.":[150],"Decisional":[151],"entities":[152],"accept":[153],"extra":[154],"costs":[155,231],"if":[156],"there":[157],"inconsistency":[160],"between":[161],"start":[163],"completion":[165],"times":[166],"two":[168],"consecutive":[169],"operations.":[170],"genetic":[172],"algorithm":[173],"employed":[175],"solve":[177],"models.":[181],"For":[182],"experimentation,":[183],"shop":[187],"simulation":[188],"program":[189],"will":[190],"developed":[192],"implement":[194],"process.":[198],"experimental":[200],"results":[201],"show":[202],"that":[203],"method":[206,230],"outperforms":[207],"stand-alone":[209],"regarding":[213],"lead":[214],"time":[215],"under":[218],"Furthermore,":[227],"sufficiently":[232],"small":[233],"time,":[234],"potentially":[237],"applied":[238],"physical":[240]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}