The optimal admission policy to a multiserver queue with finite horizon
- 1 March 1972
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 9 (1) , 103-116
- https://doi.org/10.2307/3212640
Abstract
An M/M/s queueing system with a simple cost structure is considered, under the assumption that the system will close in a finite time after which any remaining customers will require extra overtime service costs. We determine the optimal policy for admitting customers to the queue, as a function of the time, t, to closing and the current queue length, i. It is shown to have the form: admit if and only if f1(t) ≦ i ≦ f2(t). The bounds f1(t) and f2(t) are specified, and it is shown under what conditions f1(t) = 0 (a control limit rule) or f2(t) = ∞ (an inverse control limit rule).Keywords
This publication has 11 references indexed in Scilit:
- The Streetwalker’s Dilemma: A Job Shop ModelSIAM Journal on Applied Mathematics, 1971
- On Optimal Balking Rules and Toll Charges in the GI/M/1 Queuing ProcessOperations Research, 1971
- An Optimal Rejection Time for an M/G/1 Queuing SystemOperations Research, 1971
- A queueing process with varying degree of serviceNaval Research Logistics Quarterly, 1970
- A Queueing Reward System with Several Customer ClassesManagement Science, 1969
- Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down CostsOperations Research, 1969
- The Regulation of Queue Size by Levying TollsEconometrica, 1969
- Finite State Continuous Time Markov Decision Processes with a Finite Planning HorizonSIAM Journal on Control, 1968
- Markov-Renewal Programming. I: Formulation, Finite Return ModelsOperations Research, 1963
- Discrete Dynamic ProgrammingThe Annals of Mathematical Statistics, 1962