Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory

DOI10.1007/s10626-015-0219-9zbMath1346.93257OpenAlexW2151208868MaRDI QIDQ312653

Ran Li, Spyros A. Reveliotis

Publication date: 16 September 2016

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

Full work available at URL: https://doi.org/10.1007/s10626-015-0219-9

zbMATH Keywords

schedulinggeneralized stochastic Petri netsstructural analysisperformance optimizationsequential resource allocation systems

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03)

Related Items

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

Uses Software

• UMDES

Cites Work

• Supervisor reduction for discrete-event systems
• Real-time management of resource allocation systems. A discrete event systems approach.
• Performance optimization for a class of generalized stochastic Petri nets
• Supervisory control of concurrent systems. A Petri net structural approach.
• Introduction to Discrete Event Systems
• The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item