No label defined (Q3734825)
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 3967623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3967623 |
Statements
1985
0 references
semi Markovian decision process
0 references
removable servers
0 references
optimal policy
0 references
control of a shuttle and of a clearing system
0 references
0.859983503818512
0 references
0.8560473918914795
0 references
0.8492405414581299
0 references
0.8470051288604736
0 references
This paper considers the optimal operating policies for the removable servers, i.e. to decide when to open or to close the service channels. Obviously an optimal policy will be one which corresponds to an equilibrium between the following three situations: (i) too long keeping a server busy involves a too high running cost; (ii) too long keeping a server idle involves a too high holding cost; (iii) too much time changing the state of the servers involves too high switching cost. First the author studied the case of an individual service process, in M/G/1 queues with N-policy, D-policy and T-policy, respectively; certain special cases are also examined such as the finite capacity case, the case of heterogeneous customers etc. The problems of batch service are then described and two related applications are considered in detail: the control of a shuttle and of a clearing system. This paper seems to be one of the best papers in the field of queues.
0 references