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

DOI10.1007/S10626-015-0219-9MaRDI QIDQ312653zbMATH OpenOpenAlexFDO

Authors Ran Li, Spyros 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

schedulingstructural analysisperformance optimizationgeneralized stochastic Petri netssequential resource allocation systems

Mathematics Subject Classification ID

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

Recommendations

• Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
• Performance optimization for a class of generalized stochastic Petri nets
• Real-time management of resource allocation systems. A discrete event systems approach.
• Resource allocation by means of project networks: dominance results
• scientific article; zbMATH DE number 3970497

Cites work

• scientific article; zbMATH DE number 996999 (Why is no real title available?)
• scientific article; zbMATH DE number 3959244 (Why is no real title available?)
• scientific article; zbMATH DE number 1972910 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• scientific article; zbMATH DE number 805057 (Why is no real title available?)
• Dynamic programming and optimal control. Vol. 2
• Introduction to Discrete Event Systems
• Performance optimization for a class of generalized stochastic Petri nets
• Real-time management of resource allocation systems. A discrete event systems approach.
• Stochastic learning and optimization. A sensitivity-based approach.
• Supervisor reduction for discrete-event systems
• Supervisory control of concurrent systems. A Petri net structural approach.
• The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks

Cited in

(5)

• Scheduling policies using marked/phantom slot algorithms
• Design, Analysis and Implementation of a Novel Multiple Resource Scheduler
• Optimizing concurrency under Scheduling by Edge Reversal
• Throughput maximization of complex resource allocation systems through timed-continuous-Petri-net modeling
• Performance optimization for a class of generalized stochastic Petri nets

Describes a project that uses

Uses Software

• UMDES

This page was built for publication: Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory

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