A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue (Q1821013)
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: A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue |
scientific article; zbMATH DE number 3997522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue |
scientific article; zbMATH DE number 3997522 |
Statements
A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue (English)
0 references
1986
0 references
A polynomial-time algorithm is proposed for computing an optimal admission policy for GI/M/1/N queueing systems. The approach is based upon mathematical programming in which a pointwise minimal value function is to be found subject to a finite number of dynamic programming type constraints. The program is transformed by Fourier-Motzkin elimination into equivalent reduced system to which a simple, forward-substitution type algorithm can be applied.
0 references
polynomial-time algorithm
0 references
optimal admission policy
0 references
GI/M/1/N queueing systems
0 references
Fourier-Motzkin elimination
0 references
