Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory (Q312653)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory |
scientific article; zbMATH DE number 6627803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory |
scientific article; zbMATH DE number 6627803 |
Statements
Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory (English)
0 references
16 September 2016
0 references
generalized stochastic Petri nets
0 references
performance optimization
0 references
scheduling
0 references
structural analysis
0 references
sequential resource allocation systems
0 references
0 references
0 references
0.8036753535270691
0 references
0.7643463015556335
0 references
0.741115927696228
0 references
0.7321721315383911
0 references
