OPTIMAL DECISION IN QUEUEING
Abstract
A single server queueing system with Poisson arrival at rate lambda and a finite queue capacity N is considered. The service can be performed using one of K available service rates u1 = or < u2 = or < ... = or < uK. When service rate uk is in effect the service time is a random variable exponentially distributed with expected service time 1/uk, and a cost rate c(uk) is incurred. For each customer served, a reward of A will be earned. The problem is to choose service rate in order to minimize the expected discounted or expected long run average cost. The problem is formulated as a semi-Markov decision process with the state as the number of customers in the system. It is then shown that the optimal policy is switchover or reverse switchover depending upon whether or not the system is profitable. A switchover policy is a policy which uses higher rates in the higher states and a reverse switchover policy uses lower rates in the higher states.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1970
- Accession Number
- AD0708007
Entities
People
- Houshang Sabeti
Organizations
- University of California, Berkeley