Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling

DOI10.1007/S10626-019-00289-7MaRDI QIDQ2177767zbMATH OpenOpenAlexWikidataFDO

Authors Michael Nawar Ibrahim, Spyros Reveliotis

Publication date 6 May 2020

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10626-019-00289-7

zbMATH Keywords

fluid-relaxation-based schedulingPetri-net-based modeling and analysis of discrete event systemsscheduling of complex resource allocation systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Networked control (93B70) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03)

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

• Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
• Dynamic programming and optimal control. Vol. 2
• scientific article; zbMATH DE number 1220172 (Why is no real title available?)
• scientific article; zbMATH DE number 1302046 (Why is no real title available?)
• scientific article; zbMATH DE number 1341754 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• Performance optimization for a class of generalized stochastic Petri nets
• Robust Fluid Processing Networks
• 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)

• Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
• Performance optimization for a class of generalized stochastic Petri nets
• Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory

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)