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

DOI10.1007/s10626-019-00289-7zbMath1441.93291OpenAlexW2970115761WikidataQ127280524 ScholiaQ127280524MaRDI QIDQ2177767

Spyros A. Reveliotis, Michael Nawar Ibrahim

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

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

Related Items (1)

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

Cites Work

• Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
• Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling