{"id":"https://openalex.org/W4317792705","doi":"https://doi.org/10.1109/wsc57314.2022.10015352","title":"Monte Carlo Tree Search-Based Algorithm for Dynamic Job Shop Scheduling with Automated Guided Vehicles","display_name":"Monte Carlo Tree Search-Based Algorithm for Dynamic Job Shop Scheduling with Automated Guided Vehicles","publication_year":2022,"publication_date":"2022-12-11","ids":{"openalex":"https://openalex.org/W4317792705","doi":"https://doi.org/10.1109/wsc57314.2022.10015352"},"language":"en","primary_location":{"id":"doi:10.1109/wsc57314.2022.10015352","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wsc57314.2022.10015352","pdf_url":null,"source":{"id":"https://openalex.org/S4363607869","display_name":"2022 Winter Simulation Conference (WSC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081241759","display_name":"Duyeon Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Duyeon Kim","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology (KAIST),Department of Industrial and Systems Engineering,Daejeon,REPUBLIC OF KOREA,34141"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology (KAIST),Department of Industrial and Systems Engineering,Daejeon,REPUBLIC OF KOREA,34141","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100439521","display_name":"Hyun-Jung Kim","orcid":"https://orcid.org/0000-0001-7190-3264"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyun-Jung Kim","raw_affiliation_strings":["Korea Advanced Institute of Science and Technology (KAIST),Department of Industrial and Systems Engineering,Daejeon,REPUBLIC OF KOREA,34141"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Korea Advanced Institute of Science and Technology (KAIST),Department of Industrial and Systems Engineering,Daejeon,REPUBLIC OF KOREA,34141","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.3445,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52700378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":null,"first_page":"3309","last_page":"3317"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9975000023841858,"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.9975000023841858,"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.9921000003814697,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.98089998960495,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/computer-science","display_name":"Computer science","score":0.7111042141914368},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.6864254474639893},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6658145189285278},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6350080370903015},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5966954827308655},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.5915248394012451},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5614312887191772},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48181310296058655},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4802980124950409},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.440822571516037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4194886386394501},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1392194628715515},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09681451320648193}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7111042141914368},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.6864254474639893},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6658145189285278},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6350080370903015},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5966954827308655},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.5915248394012451},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5614312887191772},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48181310296058655},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4802980124950409},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.440822571516037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4194886386394501},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1392194628715515},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09681451320648193},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc57314.2022.10015352","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/wsc57314.2022.10015352","pdf_url":null,"source":{"id":"https://openalex.org/S4363607869","display_name":"2022 Winter Simulation Conference (WSC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G8554738516","display_name":null,"funder_award_id":"2022R1A2C400197811","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1543378523","https://openalex.org/W1625390266","https://openalex.org/W1973105821","https://openalex.org/W1989854233","https://openalex.org/W2018545447","https://openalex.org/W2030370304","https://openalex.org/W2085884585","https://openalex.org/W2092994132","https://openalex.org/W2116577034","https://openalex.org/W2126316555","https://openalex.org/W2305203104","https://openalex.org/W2491052542","https://openalex.org/W2999618241","https://openalex.org/W4223536612","https://openalex.org/W4246060548","https://openalex.org/W6671865485"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W1971939018","https://openalex.org/W3155166764","https://openalex.org/W2140584489"],"abstract_inverted_index":{"A":[0,45],"dynamic":[1],"job":[2],"shop":[3],"scheduling":[4],"problem":[5,24],"where":[6],"jobs":[7,62],"are":[8],"transported":[9],"by":[10,60],"automated":[11],"guided":[12],"vehicles":[13],"(AGVs)":[14],"is":[15,25,35,53],"considered":[16],"to":[17,55],"minimize":[18],"the":[19,70,74,86],"mean":[20],"flow":[21],"time.":[22],"This":[23],"first":[26],"modeled":[27],"with":[28],"a":[29,51,78,95],"timed":[30],"Petri":[31],"net":[32],"(TPN)":[33],"which":[34,88],"widely":[36],"used":[37],"for":[38,85,90],"modeling":[39],"and":[40,68],"analyzing":[41],"discrete":[42],"event":[43],"systems.":[44],"firing":[46],"rule":[47],"of":[48,73,107],"transitions":[49],"in":[50,92],"TPN":[52],"modified":[54],"derive":[56],"more":[57],"efficient":[58],"schedules":[59,91],"considering":[61],"that":[63],"have":[64],"not":[65],"arrived":[66],"yet":[67],"restricting":[69],"unnecessary":[71],"movement":[72],"AGVs.":[75],"We":[76],"propose":[77],"Monte":[79],"Carlo":[80],"Tree":[81],"Search":[82],"(MCTS)-based":[83],"algorithm":[84],"problem,":[87],"searches":[89],"advance":[93],"within":[94],"time":[96],"given":[97],"limit.":[98],"The":[99],"proposed":[100],"method":[101],"shows":[102],"better":[103],"performance":[104],"than":[105],"combinations":[106],"other":[108],"dispatching":[109],"rules.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}