Cycle Time Optimization of Deterministic Timed Weighted Marked Graphs by Transformation
Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model automated production systems, such as robotic work cells or embedded systems, and reduce the size of the model. The main problem...
Uloženo v:
| Vydáno v: | IEEE transactions on control systems technology Ročník 25; číslo 4; s. 1318 - 1330 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.07.2017
Institute of Electrical and Electronics Engineers |
| Témata: | |
| ISSN: | 1063-6536, 1558-0865 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model automated production systems, such as robotic work cells or embedded systems, and reduce the size of the model. The main problem for designers is to find a tradeoff between minimizing the cost of the resources and maximizing the system's throughput (also called cycle time). It is possible to apply analytical techniques for the cycle time optimization problem of such systems. The problem consists in finding an initial marking to minimize the cycle time (i.e., maximize the throughput) while the weighted sum of tokens in places is less than or equal to a given value. We transform a weighted marked graph into several equivalent marked graphs and formulate a mixed integer linear programming model to solve this problem. Moreover, several techniques are proposed to reduce the complexity of the proposed method. We show that the proposed method can always find an optimal solution. |
|---|---|
| AbstractList | Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model automated production systems, such as robotic work cells or embedded systems, and reduce the size of the model. The main problem for designers is to find a tradeoff between minimizing the cost of the resources and maximizing the system's throughput (also called cycle time). It is possible to apply analytical techniques for the cycle time optimization problem of such systems. The problem consists in finding an initial marking to minimize the cycle time (i.e., maximize the throughput) while the weighted sum of tokens in places is less than or equal to a given value. We transform a weighted marked graph into several equivalent marked graphs and formulate a mixed integer linear programming model to solve this problem. Moreover, several techniques are proposed to reduce the complexity of the proposed method. We show that the proposed method can always find an optimal solution. |
| Author | Giua, Alessandro Zhiwu Li Zhou He |
| Author_xml | – sequence: 1 surname: Zhou He fullname: Zhou He email: zhouhe@stu.xidian.edu.cn organization: Sch. of Electro-Mech. Eng., Xidian Univ., Xi'an, China – sequence: 2 surname: Zhiwu Li fullname: Zhiwu Li email: zhwli@xidian.edu.cn organization: Sch. of Electro-Mech. Eng., Xidian Univ., Xi'an, China – sequence: 3 givenname: Alessandro surname: Giua fullname: Giua, Alessandro email: alessandro.giua@univ-amu.fr organization: ENSAM, Aix Marseille Univ., Marseille, France |
| BackLink | https://amu.hal.science/hal-01479622$$DView record in HAL |
| BookMark | eNp9kT1PwzAQhi1UJNrCD0AsWRlS_O1krAK0SEUdCOpoOYlNDfmobAup_HqSturAwHSn0_vc6X1vAkZt12oAbhGcIQTThzx7y2cYIj7DHJGUiwswRowlMUw4G_U95CTmjPArMPH-E0JEGRZjsMn2Za2j3DY6Wu-CbeyPCrZro85Ejzpo19jW-mDLg6SKNtp-bEPfvCr31ZeFU7utj4p9lDvVetO55sBfg0ujaq9vTnUK3p-f8mwZr9aLl2y-iktCcYhTA4sEswqi1AhWUIgqxEwCK6SIFknJRUExhkJQWhnFsEKQFpjQKtVFhQ0jU3B_3LtVtdw52yi3l52ycjlfyWHWGxUpx_gb9Vp01Jau895pcwYQlEOKckhRDinKU4o9I_4wpQ0Hh8EpW_9L3h1Jq7U-XxKC8P4l5BcyM4E- |
| CODEN | IETTE2 |
| CitedBy_id | crossref_primary_10_1109_TCST_2021_3077975 crossref_primary_10_1007_s10626_019_00278_w crossref_primary_10_1109_TAC_2017_2766202 crossref_primary_10_1109_ACCESS_2019_2959904 crossref_primary_10_1109_TASE_2022_3163854 crossref_primary_10_3390_s23031447 crossref_primary_10_3390_sym14071470 crossref_primary_10_1109_TASE_2019_2932150 crossref_primary_10_1177_0020294020964840 crossref_primary_10_1109_ACCESS_2017_2768069 crossref_primary_10_1016_j_jfranklin_2022_07_040 crossref_primary_10_1109_ACCESS_2018_2880460 crossref_primary_10_1109_ACCESS_2018_2889305 crossref_primary_10_1177_1687814018781487 |
| Cites_doi | 10.1109/TSMCA.2007.914741 10.1007/s10626-016-0227-4 10.1109/TSMCA.2008.923056 10.1007/s10626-015-0220-3 10.1016/S1474-6670(17)30772-3 10.1109/TSMC.2013.2245118 10.1109/TAC.2012.2191871 10.1109/TCST.2014.2313352 10.1080/00207721.2012.670306 10.1109/CoASE.2014.6899358 10.1109/MRA.2015.2415047 10.1016/j.tcs.2012.08.012 10.1109/32.297941 10.1007/978-3-540-68746-7_28 10.1109/ETFA.1999.813105 10.1016/S1474-6670(17)48491-6 10.1109/CoASE.2015.7294075 10.1109/TSMC.2014.2373316 10.1109/AICCSA.2010.5586972 10.1007/978-1-4471-3078-9_8 10.1007/s10626-016-0225-6 10.1109/5.24143 10.1007/3-540-57163-9_13 10.1109/9.718621 10.1080/00207540802273926 10.1109/ACSD.2006.33 10.1007/s10626-015-0214-1 10.1016/S0005-1098(01)00189-3 10.1109/CACSD.2004.1393890 10.1007/s10626-014-0189-3 10.1016/j.ejor.2008.07.037 10.1109/81.139289 10.1109/TAC.2015.2389313 10.1023/A:1024055724914 10.1109/TSMCC.2007.897333 10.1109/32.67593 10.1109/TSMCA.2008.918632 |
| ContentType | Journal Article |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 97E RIA RIE AAYXX CITATION 1XC |
| DOI | 10.1109/TCST.2016.2613967 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-0865 |
| EndPage | 1330 |
| ExternalDocumentID | oai:HAL:hal-01479622v1 10_1109_TCST_2016_2613967 7736086 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Fundamental Research Funds for the Central Universities, Xidian University grantid: JB142001-15 funderid: 10.13039/501100005320 – fundername: Recruitment Program of Global Experts – fundername: Science and Technology Development Fund, MSAR grantid: 078/2015/A3 funderid: 10.13039/501100003009 – fundername: National Natural Science Foundation of China grantid: 61374068; 61472295 funderid: 10.13039/501100001809 |
| GroupedDBID | -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACBEA ACGFO ACGFS ACIWK ACKIV AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS TN5 VH1 AAYXX CITATION 1XC |
| ID | FETCH-LOGICAL-c342t-9f0b825d019f75b401d15f80d1a3e78c67b42207744dfa52a104b234d9ebd2f53 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000403496000015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1063-6536 |
| IngestDate | Sat Nov 29 14:59:16 EST 2025 Sat Nov 29 03:51:35 EST 2025 Tue Nov 18 22:28:57 EST 2025 Wed Aug 27 02:53:56 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c342t-9f0b825d019f75b401d15f80d1a3e78c67b42207744dfa52a104b234d9ebd2f53 |
| ORCID | 0000-0003-2486-1246 0000-0003-1547-5503 |
| OpenAccessLink | http://hdl.handle.net/11584/213688 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1109_TCST_2016_2613967 hal_primary_oai_HAL_hal_01479622v1 ieee_primary_7736086 crossref_citationtrail_10_1109_TCST_2016_2613967 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-07-01 |
| PublicationDateYYYYMMDD | 2017-07-01 |
| PublicationDate_xml | – month: 07 year: 2017 text: 2017-07-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE transactions on control systems technology |
| PublicationTitleAbbrev | TCST |
| PublicationYear | 2017 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
| References | ref13 ref34 ref37 ref36 ref14 teruel (ref3) 1992; 616 ref31 ref30 ref33 ref11 ref32 ref10 ref1 ref39 ref17 ref38 ref16 ref19 ref18 carlier (ref35) 1988 van hee (ref24) 2001 giua (ref12) 2002; 38 munier (ref7) 1992; 27 ref23 chrzastowski-wachtel (ref42) 1993; 710 ref26 ref25 ref20 ref41 ref22 ref21 ref43 ref28 ref27 ref29 ref8 ref9 ref4 baccelli (ref15) 1992 ref6 ref5 li (ref2) 2008; 38 ref40 |
| References_xml | – volume: 38 start-page: 369 year: 2008 ident: ref2 article-title: On controllability of dependent siphons for deadlock prevention in generalized Petri nets publication-title: IEEE Trans Syst Man Cybern A Syst Humans doi: 10.1109/TSMCA.2007.914741 – year: 1988 ident: ref35 publication-title: Problème Dórdonnancement Modélisation Complexité Algorithmes – volume: 27 start-page: 487 year: 1992 ident: ref7 article-title: Régime asymptotique optimal dún graphe dévénements temporisé généralisé: Application à un problème dássemblage publication-title: RAIPO-APII – year: 1992 ident: ref15 publication-title: Synchronization and Linearity An Algebra for Discrete Event Systems – ident: ref18 doi: 10.1007/s10626-016-0227-4 – ident: ref23 doi: 10.1109/TSMCA.2008.923056 – ident: ref19 doi: 10.1007/s10626-015-0220-3 – ident: ref21 doi: 10.1016/S1474-6670(17)30772-3 – ident: ref27 doi: 10.1109/TSMC.2013.2245118 – ident: ref10 doi: 10.1109/TAC.2012.2191871 – ident: ref5 doi: 10.1109/TCST.2014.2313352 – ident: ref22 doi: 10.1080/00207721.2012.670306 – ident: ref30 doi: 10.1109/CoASE.2014.6899358 – ident: ref31 doi: 10.1109/CoASE.2014.6899358 – ident: ref11 doi: 10.1109/MRA.2015.2415047 – ident: ref36 doi: 10.1016/j.tcs.2012.08.012 – ident: ref38 doi: 10.1109/32.297941 – ident: ref40 doi: 10.1007/978-3-540-68746-7_28 – ident: ref8 doi: 10.1109/ETFA.1999.813105 – ident: ref39 doi: 10.1016/S1474-6670(17)48491-6 – ident: ref32 doi: 10.1109/CoASE.2015.7294075 – ident: ref14 doi: 10.1109/TSMC.2014.2373316 – ident: ref28 doi: 10.1109/AICCSA.2010.5586972 – ident: ref4 doi: 10.1007/978-1-4471-3078-9_8 – ident: ref9 doi: 10.1007/s10626-016-0225-6 – ident: ref34 doi: 10.1109/5.24143 – volume: 710 start-page: 171 year: 1993 ident: ref42 article-title: Liveness of weighted circuits and the diophantine problem of frobenius publication-title: Fundamentals of Computation Theory doi: 10.1007/3-540-57163-9_13 – ident: ref16 doi: 10.1109/9.718621 – ident: ref20 doi: 10.1080/00207540802273926 – ident: ref37 doi: 10.1109/ACSD.2006.33 – ident: ref17 doi: 10.1007/s10626-015-0214-1 – volume: 38 start-page: 91 year: 2002 ident: ref12 article-title: Firing rate optimization of cyclic timed event graphs publication-title: Automatica doi: 10.1016/S0005-1098(01)00189-3 – ident: ref43 doi: 10.1109/CACSD.2004.1393890 – ident: ref25 doi: 10.1007/s10626-014-0189-3 – ident: ref41 doi: 10.1016/j.ejor.2008.07.037 – ident: ref33 doi: 10.1109/81.139289 – start-page: 23 year: 2001 ident: ref24 article-title: On the optimal allocation of resources in stochastic workflow nets publication-title: Proc 7th UK Perform Eng Workshop – ident: ref13 doi: 10.1109/TAC.2015.2389313 – volume: 616 start-page: 348 year: 1992 ident: ref3 article-title: On weighted T-systems publication-title: Application and Theory of Petri Nets – ident: ref29 doi: 10.1023/A:1024055724914 – ident: ref1 doi: 10.1109/TSMCC.2007.897333 – ident: ref6 doi: 10.1109/32.67593 – ident: ref26 doi: 10.1109/TSMCA.2008.918632 |
| SSID | ssj0014527 |
| Score | 2.3038814 |
| Snippet | Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are... |
| SourceID | hal crossref ieee |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 1318 |
| SubjectTerms | Automatic Control Engineering Computer Science Cycle time optimization Delays Manufacturing systems Mixed integer linear programming mixed integer linear programming problem (ILPP) Modeling Optimization Throughput timed Petri net (PN) Transforms weighted marked graph |
| Title | Cycle Time Optimization of Deterministic Timed Weighted Marked Graphs by Transformation |
| URI | https://ieeexplore.ieee.org/document/7736086 https://amu.hal.science/hal-01479622 |
| Volume | 25 |
| WOSCitedRecordID | wos000403496000015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-0865 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014527 issn: 1063-6536 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8QwEB5c8aAH3-L6Iognsdrm2RxldfUgKriit7JJpijoruxD2H9vkq11DyJ4akinUPKVznzJzDcAR5n1foQhJii6LuG5xcTHzS6hKKgyWlt0eWw2oW5v8-dnfT8HJ3UtDCLG5DM8DcN4lu_6dhy2ys6UYtKH4A1oKKWmtVr1iQGftmf1DIclMh5JNis9zbNO66ETkrjkqacLTMeW8j8-qPESMiBnWqtEz9Je-d87rcJyFUGS8ynkazCHvXVYmtEV3ICn1sTfIqG8g9z5f8J7VWxJ-iW5qPJfokBzNHHkKe6P-kGo3PGXq6BiPSRmQjozcW2_twmP7ctO6zqpOigklnE6SnSZGk8BnY_jSiWM51IuE2WeuqzLUOVWKsMpTX0IyF3ZFbTryZmhjDuNxtFSsC2Y7_V7uA1ESSlcZgQyKXlqpeaSGY6lZaI01uVNSL_XtLCVvHjocvFWRJqR6iLAUAQYigqGJhzXj3xMtTX-Mj70QNV2QRX7-vymCHMefKUlpZ9ZEzYCQrVVBc7O79O7sEiDk47Jt3swPxqMcR8W7OfodTg4iJ_XF_h-zEQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB7BggQcoJSibnnUQj0hAomf8REtj0XdLpUIglu0ticqEt1F7ILEv6_tDWEPFRKnWM5EivxFmfnsmW8AfmTW-xGGmKAYuITnFhMfN7uEoqDKaG3R5bHZhOr389tb_XsODppaGESMyWd4GIbxLN-N7FPYKjtSikkfgs_DguCcZtNqrebMgE8btHqOwxIZDyXbtaLmUdG5KkIalzz0hIHp2FT-zQvN_wk5kDPNVaJvOVv72Ft9gtU6hiTHU9DXYQ6Hn2FlRllwA246L_4WCQUe5NL_Ff7W5ZZkVJGTOgMmSjRHE0du4g6pH4TaHX85DzrWY2JeSDET2Y6GX-D67LTodJO6h0JiGaeTRFep8STQ-UiuUsJ4NuUyUeWpywYMVW6lMpzS1AeB3FUDQQeenhnKuNNoHK0E24TWcDTEr0CUlMJlRiCTkqdWai6Z4VhZJipjXd6G9HVNS1sLjIc-F_dlJBqpLgMMZYChrGFow37zyMNUXeM94z0PVGMXdLG7x70yzHnwlZaUPmdt2AgINVY1ON_-P_0dlrrFr17Zu-j_3IJlGlx2TMXdhtbk8Ql3YNE-T-7Gj7vxU_sHw7zPiw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Cycle+Time+Optimization+of+Deterministic+Timed+Weighted+Marked+Graphs+by+Transformation&rft.jtitle=IEEE+transactions+on+control+systems+technology&rft.au=Zhou+He&rft.au=Zhiwu+Li&rft.au=Giua%2C+Alessandro&rft.date=2017-07-01&rft.pub=IEEE&rft.issn=1063-6536&rft.volume=25&rft.issue=4&rft.spage=1318&rft.epage=1330&rft_id=info:doi/10.1109%2FTCST.2016.2613967&rft.externalDocID=7736086 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6536&client=summon |