search query: @indexterm QUEUING THEORY / total: 512
reference: 146 / 512
| Author: | Nawjin, W. M. |
| Title: | Look-ahead policies for admission to a single server loss system. |
| Journal: | Operations Research
1990 : SEP-OCT, VOL. 38:5, p. 854-862 |
| Index terms: | QUEUING THEORY DYNAMIC PROGRAMMING MARKOV CHAINS |
| Language: | eng |
| Abstract: | Many models exist for controlling the admission of arriving customers for service to a single server loss system. The optimal admission policy to a system without waiting room is analyzed, in which the controller has knowledge of the service time of the first future job and its arrival epoch. For every customer entering the system the server gets a fixed reward. The form of a stationary optimal policy is derived in the case where the server wants to maximize the total expected discounted reward as well as in the case where the server wants to maximize the average expected reward in the long run. |
SCIMA