Some thoughts on an \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue (Q1108181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4066594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some thoughts on an \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue |
scientific article; zbMATH DE number 4066594 |
Statements
Some thoughts on an \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue (English)
0 references
1988
0 references
A formerly presented \(O(N^ 3)\)-algorithm for the optimal control of arrivals in a GI/M/1/N queue is extended for solving the problems with the average reward criterion and with a general action space.
0 references
Markov decision processes
0 references
optimal control of arrivals
0 references
GI/M/1/N queue
0 references
average reward criterion
0 references
general action space
0 references
0.8951238
0 references
0.8867315
0 references
0.87934816
0 references
0.87810224
0 references
0.8756964
0 references
0.8752392
0 references
0.8695954
0 references
