{"id":"https://openalex.org/W1972477976","doi":"https://doi.org/10.1109/coase.2012.6386386","title":"Scheduling of Petri nets as a multi-objective shortest path problem","display_name":"Scheduling of Petri nets as a multi-objective shortest path problem","publication_year":2012,"publication_date":"2012-08-01","ids":{"openalex":"https://openalex.org/W1972477976","doi":"https://doi.org/10.1109/coase.2012.6386386","mag":"1972477976"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2012.6386386","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2012.6386386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5019877446","display_name":"Uno Wikborg","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":"Uno Wikborg","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon 305-701, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon 305-701, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"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, Daejeon, South Korea","Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon 305-701, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon 305-701, Republic of Korea","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.8575,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66677691,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"111","issue":null,"first_page":"212","last_page":"217"},"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9962999820709229,"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.7869613766670227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6971838474273682},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6945400238037109},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6378006935119629},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5998775362968445},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5396144390106201},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4762425720691681},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46293893456459045},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.438468873500824},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.43113014101982117},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.420365571975708},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31715109944343567},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30554211139678955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1931649148464203},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09863349795341492},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.09809693694114685}],"concepts":[{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7869613766670227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6971838474273682},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6945400238037109},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6378006935119629},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5998775362968445},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5396144390106201},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4762425720691681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46293893456459045},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.438468873500824},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.43113014101982117},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.420365571975708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31715109944343567},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30554211139678955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1931649148464203},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09863349795341492},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.09809693694114685},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2012.6386386","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2012.6386386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1527511816","https://openalex.org/W1543378523","https://openalex.org/W1977927233","https://openalex.org/W1996109622","https://openalex.org/W1997188340","https://openalex.org/W2017598274","https://openalex.org/W2019327275","https://openalex.org/W2023770634","https://openalex.org/W2030406435","https://openalex.org/W2051956023","https://openalex.org/W2076731132","https://openalex.org/W2081611983","https://openalex.org/W2095429874","https://openalex.org/W2096110679","https://openalex.org/W2103693167","https://openalex.org/W2109845613","https://openalex.org/W2110050374","https://openalex.org/W2112161942","https://openalex.org/W2114356561","https://openalex.org/W2147965468","https://openalex.org/W2153278771","https://openalex.org/W2159411172","https://openalex.org/W2164931233","https://openalex.org/W2293465224","https://openalex.org/W2796276184","https://openalex.org/W3122485362","https://openalex.org/W3124318612","https://openalex.org/W3211548125","https://openalex.org/W4242037947","https://openalex.org/W6670860085","https://openalex.org/W6676588952","https://openalex.org/W6750172789"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2225350526","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2167574351","https://openalex.org/W3036719625","https://openalex.org/W2367142822","https://openalex.org/W2978148977"],"abstract_inverted_index":{"Petri":[0,33,134],"nets":[1],"are":[2],"widely":[3],"used":[4],"for":[5,23,31,69,85,111],"modeling":[6],"and":[7,37,75,127,157],"analysis":[8],"of":[9,96,148],"discrete":[10],"event":[11],"dynamic":[12,128],"systems":[13,19],"such":[14],"as":[15,152],"complex":[16],"automated":[17],"manufacturing":[18],"or":[20,83],"cluster":[21,140],"tools":[22],"semiconductor":[24],"manufacturing.":[25],"We":[26,105,130,144],"define":[27],"a":[28,62,107,155],"data":[29],"structure":[30],"noncyclic":[32,139],"net":[34],"scheduling":[35,41,136,142,150],"problems":[36,116],"then":[38,131],"transform":[39],"the":[40,52,57,66,78,86,93,97,103,119,125,133,146,149],"problem":[42,50,59],"into":[43],"an":[44],"equivalent":[45],"multi-objective":[46,113],"shortest":[47,114],"path":[48,63,115,120],"(MSP)":[49],"in":[51,124],"state":[53],"transition":[54],"graph.":[55],"Solving":[56],"MSP":[58],"will":[60,90],"find":[61],"which":[64],"minimizes":[65],"completion":[67],"time":[68],"tokens":[70],"at":[71],"each":[72],"subsequence":[73],"step,":[74],"hence":[76],"when":[77],"corresponding":[79,101],"resource":[80],"becomes":[81],"available":[82],"ready":[84],"next":[87],"task.":[88],"This":[89],"ultimately":[91],"minimize":[92],"firing":[94],"epoch":[95],"final":[98],"destination":[99],"transition,":[100],"to":[102,117,138,154],"makespan.":[104],"extend":[106],"label":[108],"correction":[109],"algorithm":[110],"existing":[112],"handle":[118],"dependent":[121],"edge":[122],"lengths":[123],"graph":[126],"objectives.":[129],"apply":[132],"net-based":[135],"method":[137,151],"tool":[141],"problems.":[143],"demonstrate":[145],"efficiency":[147],"compared":[153],"branch":[156],"bound":[158],"method.":[159]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}