A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity (Q1592328): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:18, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity |
scientific article |
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