Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
From MaRDI portal
Publication:2177767
Recommendations
- Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
- Performance optimization for a class of generalized stochastic Petri nets
- Petri net based scheduling
- scientific article; zbMATH DE number 4074793
- scientific article; zbMATH DE number 3896317
Cites work
- Autonomous continuous P/T systems
- Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
- Dynamic programming and optimal control. Vol. 2
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- Linear algebraic and linear programming techniques for the analysis of place/transition net systems
- Performance optimization for a class of generalized stochastic Petri nets
- Robust Fluid Processing Networks
- Supervisory control of discrete event systems using Petri nets
- The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
- The Stability of Two-Station Multitype Fluid Networks
- Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
Cited in
(3)
This page was built for publication: Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177767)