| dc.contributor | 資管系 | |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | |
| dc.date (日期) | 2009-11 | |
| dc.date.accessioned | 12-Jan-2015 15:34:11 (UTC+8) | - |
| dc.date.available | 12-Jan-2015 15:34:11 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Jan-2015 15:34:11 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/72838 | - |
| dc.description.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. | |
| dc.format.extent | 411740 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.relation (關聯) | Int J Adv Manuf Technol,45(3),397-405 | |
| dc.subject (關鍵詞) | Petri nets; Siphons; Deadlocks ;Integer programming | |
| dc.title (題名) | Direct Minimal Empty Siphon Computation Using MIP | |
| dc.type (資料類型) | article | en |
| dc.identifier.doi (DOI) | 10.1007/s00170-009-1967-1 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/s00170-009-1967-1 | en_US |
