The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Solving Siphons with the Minimal Cardinality for Deadlock Control
Abstract
By modifying the objective function and adding new constraints to a Mixed Integer Programming (MIP) method proposed by Park and Reveliotis, this chapter presents a Revised MIP (RMIP) method to directly solve siphons, called smart siphons, with the minimal cardinality as well as the minimal number of resource places. Accordingly, a proper Control Place (CP) is added for each smart siphon in order to achieve the desired control. Both efficiency and practicality of this method are proved through a theoretical proof and several examples.
Related Content
Tanima Sahoo, Arijit Mondal, Piyal Roy, Amitava Podder.
© 2024.
20 pages.
|
Hüseyin Fatih Çetinkaya, Ali Fazıl Yenidünya, Serap Çetinkaya, Burak Tüzün.
© 2024.
15 pages.
|
Digvijay Pandey, Vinay Kumar Nassa, Binay Kumar Pandey, Blessy Thankachan, Pankaj Dadheech, Darshan A Mahajan, A. Shaji George.
© 2024.
22 pages.
|
Loutfy H. Madkour.
© 2024.
38 pages.
|
Loutfy H. Madkour.
© 2024.
50 pages.
|
Rita Komalasari.
© 2024.
25 pages.
|
Aakifa Shahul, Balakumar Muniandi, Mukundan Appadurai Paramashivan, Digvijay Pandey, Binay Kumar Pandey, Pankaj Dadheech, Hovan George.
© 2024.
14 pages.
|
|
|