A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity (Q1592328)
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 1552895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity |
scientific article; zbMATH DE number 1552895 |
Statements
A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity (English)
0 references
5 July 2001
0 references
In an M/G/1 queueing system the server is turned off whenever the system becomes empty and turned on again as soon as \(N\) customers are present. The number \(N\) is the parameter that can be controlled for an optimal operating policy. The main feature in this paper is the consideration of a finite waiting room. The authors describe a recursive method to determine the steady state probabilities for the queue length. Simple special cases are worked out in detail.
0 references
cost
0 references
control
0 references
M/G/1 queue
0 references
removable server
0 references
0 references
0 references
0 references
0 references
0.9178804
0 references
0.91571903
0 references
0.91519445
0 references
0.91012573
0 references
0.9036085
0 references
