Process completing sequences for resource allocation systems with synchronization

DOI10.1155/2012/424051zbMATH Open1248.93060OpenAlexW2125647292WikidataQ58907963 ScholiaQ58907963MaRDI QIDQ446469FDOQ446469

Authors Song Foh Chew, Shengyong Wang, Mark A. Lawley

Publication date 6 September 2012

Published in Journal of Control Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/424051

zbMATH Keywords

NP-completePetri netspolynomial methodscapacity boundsGeneralized Augmented Marked Graphslive resource allocationprocess completing sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete event control/observation systems (93C65)

Recommendations

• scientific article; zbMATH DE number 3874587
• Resource-constrained workflow nets
• Resource Allocation Systems: Some Complexity Results on the S4PR Class
• The Discrete Resource Allocation Problem in Flow Lines
• Complexity of the deadlock problem for Petri nets modeling resource allocation systems

Cites work

• scientific article; zbMATH DE number 1820096 (Why is no real title available?)
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
• Robustness analysis of non-ordinary Petri nets for flexible assembly systems

Cited in

(2)

• scientific article; zbMATH DE number 744092 (Why is no real title available?)
• Assignment and sequencing models for the scheduling of process systems

This page was built for publication: Process completing sequences for resource allocation systems with synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446469)