English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93190/123562 (75%)
Visitors : 27642059      Online Users : 289
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/72838
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/72838

    Title: Direct Minimal Empty Siphon Computation Using MIP
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: Petri nets;Siphons;Deadlocks;Integer programming
    Date: 2009-11
    Issue Date: 2015-01-12 15:34:11 (UTC+8)
    Abstract: We propose a revised mixed-integer programming (MIP) method to directly compute unmarked siphons with a minimal number of places. This eliminates the need to deduce a minimal siphon from an unmarked maximal siphon obtained from the traditional MIP method proposed by Chu et al. The revised MIP test reports smaller siphons earlier than larger siphons and adds monitors to basic siphons before compound siphons. This results in adding fewer monitors and reaching more states.
    Relation: Int J Adv Manuf Technol,45(3),397-405
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1007/s00170-009-1967-1
    DOI: 10.1007/s00170-009-1967-1
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    397-405.pdf402KbAdobe PDF719View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback