{"id":"https://openalex.org/W2093541957","doi":"https://doi.org/10.1109/tase.2014.2313979","title":"Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets","display_name":"Time-Feasible Reachability Tree for Noncyclic Scheduling of Timed Petri Nets","publication_year":2014,"publication_date":"2014-04-11","ids":{"openalex":"https://openalex.org/W2093541957","doi":"https://doi.org/10.1109/tase.2014.2313979","mag":"2093541957"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2014.2313979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2014.2313979","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"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 Transactions on Automation Science and Engineering","raw_type":"journal-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/A5100439521","display_name":"Hyun-Jung Kim","orcid":"https://orcid.org/0000-0002-5247-1395"},"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":true,"raw_author_name":"Hyun-Jung Kim","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea","Department of Industrial & Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial & Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100366235","display_name":"Jun-Ho Lee","orcid":"https://orcid.org/0000-0001-7693-8896"},"institutions":[{"id":"https://openalex.org/I2250650973","display_name":"Samsung (South Korea)","ror":"https://ror.org/04w3jy968","country_code":"KR","type":"company","lineage":["https://openalex.org/I2250650973"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jun-Ho Lee","raw_affiliation_strings":["Samsung Electronics, Manufacturing Technology Center, Suwon, Korea","Manufacturing Technology Center, Samsung Electronics, Suwon, Korea"],"affiliations":[{"raw_affiliation_string":"Samsung Electronics, Manufacturing Technology Center, Suwon, Korea","institution_ids":["https://openalex.org/I2250650973"]},{"raw_affiliation_string":"Manufacturing Technology Center, Samsung Electronics, Suwon, Korea","institution_ids":["https://openalex.org/I2250650973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014167840","display_name":"Tae\u2010Eog Lee","orcid":"https://orcid.org/0000-0003-0885-6359"},"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":"Tae-Eog Lee","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea","Department of Industrial & Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial & Systems Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100439521"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":6.7655,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.97291688,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"3","first_page":"1007","last_page":"1016"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9983999729156494,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9970999956130981,"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/petri-net","display_name":"Petri net","score":0.9163120985031128},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8537678718566895},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7206096649169922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.707598865032196},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6300371885299683},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.553311288356781},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.550224781036377},{"id":"https://openalex.org/keywords/process-architecture","display_name":"Process architecture","score":0.5422249436378479},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5395452380180359},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.450428307056427},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43856024742126465},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42644453048706055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.27552229166030884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2749597430229187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.196530282497406},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.14319634437561035},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12523505091667175},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09717866778373718},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0911797285079956},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08639344573020935}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.9163120985031128},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8537678718566895},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7206096649169922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.707598865032196},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6300371885299683},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.553311288356781},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.550224781036377},{"id":"https://openalex.org/C136155141","wikidata":"https://www.wikidata.org/wiki/Q7247260","display_name":"Process architecture","level":3,"score":0.5422249436378479},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5395452380180359},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.450428307056427},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43856024742126465},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42644453048706055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.27552229166030884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2749597430229187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.196530282497406},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.14319634437561035},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12523505091667175},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09717866778373718},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0911797285079956},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08639344573020935},{"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/tase.2014.2313979","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2014.2313979","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"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 Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W23112316","https://openalex.org/W1519324376","https://openalex.org/W1527132796","https://openalex.org/W1543378523","https://openalex.org/W1981704280","https://openalex.org/W1983788549","https://openalex.org/W1996109622","https://openalex.org/W2002235729","https://openalex.org/W2002556739","https://openalex.org/W2009441467","https://openalex.org/W2011121744","https://openalex.org/W2012629892","https://openalex.org/W2016738003","https://openalex.org/W2019027929","https://openalex.org/W2024711394","https://openalex.org/W2025592351","https://openalex.org/W2039104801","https://openalex.org/W2041795078","https://openalex.org/W2054188201","https://openalex.org/W2091774446","https://openalex.org/W2096110679","https://openalex.org/W2103504376","https://openalex.org/W2103693167","https://openalex.org/W2108209941","https://openalex.org/W2110050374","https://openalex.org/W2110629569","https://openalex.org/W2112161942","https://openalex.org/W2115448177","https://openalex.org/W2128805196","https://openalex.org/W2129855961","https://openalex.org/W2130561017","https://openalex.org/W2131087757","https://openalex.org/W2136582725","https://openalex.org/W2137987710","https://openalex.org/W2141103600","https://openalex.org/W2141563078","https://openalex.org/W2143593195","https://openalex.org/W2144265184","https://openalex.org/W2144283213","https://openalex.org/W2144623944","https://openalex.org/W2150135802","https://openalex.org/W2151786168","https://openalex.org/W2158814988","https://openalex.org/W2171514102","https://openalex.org/W6631466428","https://openalex.org/W6676588952"],"related_works":["https://openalex.org/W3125880387","https://openalex.org/W2753275255","https://openalex.org/W1543378523","https://openalex.org/W1980200158","https://openalex.org/W2136709541","https://openalex.org/W2059607773","https://openalex.org/W2154794415","https://openalex.org/W2389843176","https://openalex.org/W2159152215","https://openalex.org/W1531156418"],"abstract_inverted_index":{"Petri":[0,50,97,320],"nets":[1,98],"are":[2,37,181],"useful":[3],"for":[4,20,70,143,211,217,240,285,317,349,355],"modeling":[5],"and":[6,23,28,32,48,72,82,100,107,116,214,243,266,277,280,352,359],"analyzing":[7],"complex":[8,29],"scheduling":[9,33,39,88,218,231,244,283,368,391],"problems":[10,89,392],"of":[11,45,75,148,168,185,254,340,389],"automated":[12,53,255],"manufacturing":[13,22,54,256],"systems,":[14],"such":[15,46],"as":[16,304],"robotized":[17],"cluster":[18,63,229,366,373],"tools":[19,64],"semiconductor":[21],"robot":[24],"cells":[25],"with":[26,154,227,272,364,375,393],"diverse":[27],"tool":[30,230,367,374],"architectures":[31],"requirements.":[34],"While":[35],"there":[36],"many":[38,281,390],"works":[40,249],"on":[41],"cyclic":[42],"operation":[43,59],"cycles":[44,69],"systems":[47,55,257],"their":[49],"net":[51],"models,":[52,264],"have":[56,236,250],"significant":[57],"noncyclic":[58,87],"cycles.":[60],"For":[61],"instance,":[62],"cannot":[65],"repeat":[66],"identical":[67],"work":[68],"start-up":[71],"close-down":[73],"operations":[74],"a":[76,105,166,193,212,219,273,286,305,318,325,330,350,357],"lot,":[77],"lot":[78],"switching,":[79],"nonidentical":[80],"wafers,":[81],"too":[83],"small":[84,319],"lots.":[85],"Such":[86],"can":[90,101,301,378,383],"also":[91],"be":[92,102,131,302,379],"well":[93],"modeled":[94],"by":[95,104,114,174,258,290,334],"timed":[96],"(TPNs)":[99],"solved":[103,380],"branch":[106,213,265,276,351],"bound":[108,215,267,278,353],"procedure":[109,216,354],"that":[110,180,197],"explores":[111],"feasible":[112,145],"states":[113,179],"branching":[115],"deleting":[117,175],"the":[118,122,136,149,171,176,203,252,294,308,311,345,385],"corresponding":[119],"nodes":[120,142,177],"in":[121,127,183,293,307,338],"reachability":[123,172,195,295,327,332,347],"tree.":[124,309],"The":[125,139,275],"tree":[126,140,173,196,296,312,328,333,348],"general":[128],"tends":[129],"to":[130,234],"large,":[132],"which":[133],"significantly":[134,169],"limits":[135],"computational":[137,224],"efficiency.":[138],"generates":[141,198],"all":[144],"markings":[146],"regardless":[147],"time":[150,186,341],"evolution":[151],"information":[152],"associated":[153],"token":[155],"holding":[156],"times":[157],"or":[158,178,269],"firing":[159],"delays.":[160],"In":[161],"this":[162,394],"paper,":[163],"we":[164,191,323],"develop":[165],"way":[167],"reducing":[170],"infeasible":[182,336],"view":[184,339],"evolution.":[187,342],"To":[188],"do":[189],"this,":[190],"propose":[192,324],"time-feasible":[194,200,331,346],"only":[199],"solutions":[201,289,337],"under":[202],"earliest":[204],"starting":[205],"policy.":[206],"We":[207,221,343,382],"then":[208],"use":[209,344],"it":[210],"TPN.":[220,274],"demonstrate":[222],"its":[223,360],"efficiency":[225],"improvement":[226],"linear":[228,365,372],"problems.":[232,369],"Note":[233],"Practitioners-TPNs":[235],"been":[237],"widely":[238],"used":[239],"modeling,":[241],"analyzing,":[242],"discrete-event":[245],"dynamic":[246],"systems.":[247],"Many":[248],"improved":[251],"performance":[253],"developing":[259],"efficient":[260],"mixed":[261],"integer":[262],"programming":[263],"algorithms,":[268],"specialized":[270],"strategies":[271],"procedures":[279],"other":[282],"methods":[284],"TPN":[287],"search":[288],"exploring":[291],"paths":[292],"because":[297],"every":[298],"possible":[299],"sequence":[300],"identified":[303],"path":[306],"However,":[310],"is":[313,362],"so":[314],"large":[315],"even":[316],"net.":[321],"Hence,":[322],"reduced":[326],"called":[329],"eliminating":[335],"solving":[356],"TPN,":[358],"effectiveness":[361],"verified":[363],"A":[370],"dual-armed":[371],"25":[376],"wafers":[377],"easily.":[381],"extend":[384],"solvable":[386],"problem":[387],"ranges":[388],"research.":[395]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}