Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory (Q312653): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10626-015-0219-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151208868 / rank | |||
Normal rank | |||
Revision as of 02:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory |
scientific article |
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
