Name
Title | ||
|---|---|---|
Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theory |
Abstract | ||
|---|---|---|
In a recent work we have proposed a theoretical framework for developing optimized scheduling policies for complex resource allocation systems (RAS). This framework relies heavily on the expression of the RAS dynamics in the modeling framework of the Generalized Stochastic Petri Nets (GSPNs), and the employment of this GSPN-based representation towards the establishment of a systematic trade-off between the representational economy of the target scheduling policies and their operational efficiency. In this paper, we enhance the representational economy of the target policies in the aforementioned framework by taking advantage of some notions of “(non-)conflict” in the transitional dynamics of the underlying RAS-modeling GSPNs. A series of numerical experiments demonstrate that the representational gains resulting from the presented methodology can be very substantial. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10626-015-0219-9 | Conference on Decision and Control |
Keywords | Field | DocType |
Generalized stochastic petri nets,Performance optimization,Scheduling,Structural analysis,Sequential resource allocation systems | Resource management,Mathematical optimization,Job shop scheduling,Scheduling (computing),Concurrency,Computer science,Stochastic process,Stochastic Petri net,Dynamic priority scheduling,Operational efficiency | Conference |
Volume | Issue | ISSN |
26 | 3 | 0924-6703 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ran Li | 1 | 3 | 0.74 |
| Spyros A. Reveliotis | 2 | 140 | 18.02 |