Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems
In this paper, we study the open shop scheduling problem with blocking and deadlocks. First, we develop a new Petri net class that extends the well-known \text{S}^{3}\text{R} nets to handle the features of open shop systems. Next, we establish necessary conditions for deadlock-free operation based...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on systems, man, and cybernetics. Systems man, and cybernetics. Systems, 2018-06, Vol.48 (6), p.1017-1028 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1028 |
|---|---|
| container_issue | 6 |
| container_start_page | 1017 |
| container_title | IEEE transactions on systems, man, and cybernetics. Systems |
| container_volume | 48 |
| creator | Mejia, Gonzalo Caballero-Villalobos, Juan Pablo Montoya, Carlos |
| description | In this paper, we study the open shop scheduling problem with blocking and deadlocks. First, we develop a new Petri net class that extends the well-known \text{S}^{3}\text{R} nets to handle the features of open shop systems. Next, we establish necessary conditions for deadlock-free operation based on the properties of a particular structural siphon. Then, we implement a graph search algorithm that intelligently explores the net reachability graph and uses a search strategy based on a double filtering mechanism and new evaluation functions. We conducted computational tests on a set of classical instances adapted from the literature. The quality of the solutions was established with a lower bound calculated with the aforementioned siphon. The results show the validity of the approach: the proposed algorithm found solutions with values that were very close to the lower bound in most cases. |
| doi_str_mv | 10.1109/TSMC.2017.2707494 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TSMC_2017_2707494</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7946179</ieee_id><sourcerecordid>2174527260</sourcerecordid><originalsourceid>FETCH-LOGICAL-c293t-5d49d27e5cb6183839d139b739d7513b3aa657abfffd14ced1b1eec4110959f43</originalsourceid><addsrcrecordid>eNo9kM1OwzAQhCMEElXpAyAuljineO3Ejo-o_KulSClny4nXNKVNip0c-vYkatXTrLTfzGonim6BTgGoeljli9mUUZBTJqlMVHIRjRiILGaMs8vzDOI6moSwoZQCywSnYhR9fGHrK_KJbSCmtuQJjd025W_84hFJXq7Rdtuq_iGNI8s91iRfN3uyMHXnTNl2fljlh9DiLtxEV85sA05OOo6-X55Xs7d4vnx9nz3O45Ip3sapTZRlEtOyEJDxjCsLXBWyV5kCL7gxIpWmcM5ZSEq0UABimQyfpsolfBzdH3P3vvnrMLR603S-7k9qBjJJmWSC9hQcqdI3IXh0eu-rnfEHDVQPWXpoTQ-t6VNrvefu6KkQ8cxLlQiQiv8DdTNneA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174527260</pqid></control><display><type>article</type><title>Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems</title><source>IEEE Electronic Library (IEL)</source><creator>Mejia, Gonzalo ; Caballero-Villalobos, Juan Pablo ; Montoya, Carlos</creator><creatorcontrib>Mejia, Gonzalo ; Caballero-Villalobos, Juan Pablo ; Montoya, Carlos</creatorcontrib><description>In this paper, we study the open shop scheduling problem with blocking and deadlocks. First, we develop a new Petri net class that extends the well-known <inline-formula> <tex-math notation="LaTeX">\text{S}^{3}\text{R} </tex-math></inline-formula> nets to handle the features of open shop systems. Next, we establish necessary conditions for deadlock-free operation based on the properties of a particular structural siphon. Then, we implement a graph search algorithm that intelligently explores the net reachability graph and uses a search strategy based on a double filtering mechanism and new evaluation functions. We conducted computational tests on a set of classical instances adapted from the literature. The quality of the solutions was established with a lower bound calculated with the aforementioned siphon. The results show the validity of the approach: the proposed algorithm found solutions with values that were very close to the lower bound in most cases.</description><identifier>ISSN: 2168-2216</identifier><identifier>EISSN: 2168-2232</identifier><identifier>DOI: 10.1109/TSMC.2017.2707494</identifier><identifier>CODEN: ITSMFE</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Deadlock-free scheduling ; filtered beam search (FBS) ; Heuristic algorithms ; Job shop scheduling ; Lower bounds ; Manufacturing systems ; open shop ; Petri nets ; Petri nets (PNs) ; Production scheduling ; Routing ; Scheduling ; Search algorithms ; System recovery</subject><ispartof>IEEE transactions on systems, man, and cybernetics. Systems, 2018-06, Vol.48 (6), p.1017-1028</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c293t-5d49d27e5cb6183839d139b739d7513b3aa657abfffd14ced1b1eec4110959f43</citedby><cites>FETCH-LOGICAL-c293t-5d49d27e5cb6183839d139b739d7513b3aa657abfffd14ced1b1eec4110959f43</cites><orcidid>0000-0002-3769-2683</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7946179$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54737</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7946179$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mejia, Gonzalo</creatorcontrib><creatorcontrib>Caballero-Villalobos, Juan Pablo</creatorcontrib><creatorcontrib>Montoya, Carlos</creatorcontrib><title>Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems</title><title>IEEE transactions on systems, man, and cybernetics. Systems</title><addtitle>TSMC</addtitle><description>In this paper, we study the open shop scheduling problem with blocking and deadlocks. First, we develop a new Petri net class that extends the well-known <inline-formula> <tex-math notation="LaTeX">\text{S}^{3}\text{R} </tex-math></inline-formula> nets to handle the features of open shop systems. Next, we establish necessary conditions for deadlock-free operation based on the properties of a particular structural siphon. Then, we implement a graph search algorithm that intelligently explores the net reachability graph and uses a search strategy based on a double filtering mechanism and new evaluation functions. We conducted computational tests on a set of classical instances adapted from the literature. The quality of the solutions was established with a lower bound calculated with the aforementioned siphon. The results show the validity of the approach: the proposed algorithm found solutions with values that were very close to the lower bound in most cases.</description><subject>Deadlock-free scheduling</subject><subject>filtered beam search (FBS)</subject><subject>Heuristic algorithms</subject><subject>Job shop scheduling</subject><subject>Lower bounds</subject><subject>Manufacturing systems</subject><subject>open shop</subject><subject>Petri nets</subject><subject>Petri nets (PNs)</subject><subject>Production scheduling</subject><subject>Routing</subject><subject>Scheduling</subject><subject>Search algorithms</subject><subject>System recovery</subject><issn>2168-2216</issn><issn>2168-2232</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kM1OwzAQhCMEElXpAyAuljineO3Ejo-o_KulSClny4nXNKVNip0c-vYkatXTrLTfzGonim6BTgGoeljli9mUUZBTJqlMVHIRjRiILGaMs8vzDOI6moSwoZQCywSnYhR9fGHrK_KJbSCmtuQJjd025W_84hFJXq7Rdtuq_iGNI8s91iRfN3uyMHXnTNl2fljlh9DiLtxEV85sA05OOo6-X55Xs7d4vnx9nz3O45Ip3sapTZRlEtOyEJDxjCsLXBWyV5kCL7gxIpWmcM5ZSEq0UABimQyfpsolfBzdH3P3vvnrMLR603S-7k9qBjJJmWSC9hQcqdI3IXh0eu-rnfEHDVQPWXpoTQ-t6VNrvefu6KkQ8cxLlQiQiv8DdTNneA</recordid><startdate>20180601</startdate><enddate>20180601</enddate><creator>Mejia, Gonzalo</creator><creator>Caballero-Villalobos, Juan Pablo</creator><creator>Montoya, Carlos</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-3769-2683</orcidid></search><sort><creationdate>20180601</creationdate><title>Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems</title><author>Mejia, Gonzalo ; Caballero-Villalobos, Juan Pablo ; Montoya, Carlos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c293t-5d49d27e5cb6183839d139b739d7513b3aa657abfffd14ced1b1eec4110959f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Deadlock-free scheduling</topic><topic>filtered beam search (FBS)</topic><topic>Heuristic algorithms</topic><topic>Job shop scheduling</topic><topic>Lower bounds</topic><topic>Manufacturing systems</topic><topic>open shop</topic><topic>Petri nets</topic><topic>Petri nets (PNs)</topic><topic>Production scheduling</topic><topic>Routing</topic><topic>Scheduling</topic><topic>Search algorithms</topic><topic>System recovery</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mejia, Gonzalo</creatorcontrib><creatorcontrib>Caballero-Villalobos, Juan Pablo</creatorcontrib><creatorcontrib>Montoya, Carlos</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on systems, man, and cybernetics. Systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mejia, Gonzalo</au><au>Caballero-Villalobos, Juan Pablo</au><au>Montoya, Carlos</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems</atitle><jtitle>IEEE transactions on systems, man, and cybernetics. Systems</jtitle><stitle>TSMC</stitle><date>2018-06-01</date><risdate>2018</risdate><volume>48</volume><issue>6</issue><spage>1017</spage><epage>1028</epage><pages>1017-1028</pages><issn>2168-2216</issn><eissn>2168-2232</eissn><coden>ITSMFE</coden><abstract>In this paper, we study the open shop scheduling problem with blocking and deadlocks. First, we develop a new Petri net class that extends the well-known <inline-formula> <tex-math notation="LaTeX">\text{S}^{3}\text{R} </tex-math></inline-formula> nets to handle the features of open shop systems. Next, we establish necessary conditions for deadlock-free operation based on the properties of a particular structural siphon. Then, we implement a graph search algorithm that intelligently explores the net reachability graph and uses a search strategy based on a double filtering mechanism and new evaluation functions. We conducted computational tests on a set of classical instances adapted from the literature. The quality of the solutions was established with a lower bound calculated with the aforementioned siphon. The results show the validity of the approach: the proposed algorithm found solutions with values that were very close to the lower bound in most cases.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TSMC.2017.2707494</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-3769-2683</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2168-2216 |
| ispartof | IEEE transactions on systems, man, and cybernetics. Systems, 2018-06, Vol.48 (6), p.1017-1028 |
| issn | 2168-2216 2168-2232 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TSMC_2017_2707494 |
| source | IEEE Electronic Library (IEL) |
| subjects | Deadlock-free scheduling filtered beam search (FBS) Heuristic algorithms Job shop scheduling Lower bounds Manufacturing systems open shop Petri nets Petri nets (PNs) Production scheduling Routing Scheduling Search algorithms System recovery |
| title | Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T09%3A19%3A25IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Petri%20Nets%20and%20Deadlock-Free%20Scheduling%20of%20Open%20Shop%20Manufacturing%20Systems&rft.jtitle=IEEE%20transactions%20on%20systems,%20man,%20and%20cybernetics.%20Systems&rft.au=Mejia,%20Gonzalo&rft.date=2018-06-01&rft.volume=48&rft.issue=6&rft.spage=1017&rft.epage=1028&rft.pages=1017-1028&rft.issn=2168-2216&rft.eissn=2168-2232&rft.coden=ITSMFE&rft_id=info:doi/10.1109/TSMC.2017.2707494&rft_dat=%3Cproquest_RIE%3E2174527260%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174527260&rft_id=info:pmid/&rft_ieee_id=7946179&rfr_iscdi=true |