Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach (Q1396274): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:58, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach |
scientific article |
Statements
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach (English)
0 references
30 June 2003
0 references
Markov decision process
0 references
restless bandits
0 references
polyhedral combinatorics
0 references
extended polymatroid
0 references
adaptive-greedy algorithm
0 references
stochastic scheduling
0 references
threshold policy
0 references
index policy
0 references
Gittins index
0 references
Klimov index
0 references
Whittle index
0 references
control of queues
0 references
routing
0 references
make-to-stock
0 references
multiclass queue
0 references
finite buffers
0 references
conversation laws
0 references
achievable performance
0 references
