Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory
DOI10.1007/S10626-015-0219-9zbMATH Open1346.93257OpenAlexW2151208868MaRDI QIDQ312653FDOQ312653
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
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
schedulingstructural analysisperformance optimizationgeneralized stochastic Petri netssequential resource allocation systems
Discrete event control/observation systems (93C65) Stochastic systems in control theory (general) (93E03) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic learning and optimization. A sensitivity-based approach.
- Introduction to Discrete Event Systems
- Dynamic programming and optimal control. Vol. 2
- 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.
- Title not available (Why is that?)
- Title not available (Why is that?)
- The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks
- Title not available (Why is that?)
Cited In (5)
- Design, Analysis and Implementation of a Novel Multiple Resource Scheduler
- Scheduling policies using marked/phantom slot algorithms
- 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
Uses Software
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)
