Optimal control of arrivals to queues with delayed queue length information
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors consider discrete-time versions of two classical problems in the optimal control of admission to a queuing system: (i) optimal routing of arrivals to two parallel queues and (ii) optimal acceptance/rejection of arrivals to a single queue. They extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric interarrival times and geometric service times, the problems are formulated as controlled Markov chains with expected total discounted cost as the minimization objective. For problem (i) it is shown that, when k=1, the optimal policy is to allocate an arrival to the queue with the smaller expected queue length. For problem (ii) it is shown that, when k=1, the optimal policy is a threshold policy.Keywords
This publication has 6 references indexed in Scilit:
- Optimal control of admission to a quenching systemIEEE Transactions on Automatic Control, 1985
- Optimal control of a queueing system with two heterogeneous serversIEEE Transactions on Automatic Control, 1984
- Optimal control of two interacting service stationsIEEE Transactions on Automatic Control, 1984
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978
- Optimality of the shortest line disciplineJournal of Applied Probability, 1977