# Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs

@article{Stidham1989MonotonicAI, title={Monotonic and Insensitive Optimal Policies for Control of Queues with Undiscounted Costs}, author={Shaler Stidham and Richard R. Weber}, journal={Oper. Res.}, year={1989}, volume={37}, pages={611-625} }

We consider the problem of controlling the service and/or arrival rates in queues, with the objective of minimizing the total expected cost to reach state zero. We present a unified, simple method for proving that an optimal policy is monotonic in the number of customers in the system. Applications to average-cost minimization over an infinite horizon are given. Both exponential and nonexponential models are considered; the essential characteristic is a left-skip-free transition structure and a…

## Topics from this paper

## 119 Citations

Monotone Optimal Policies for Left-Skip-Free Markov Decision Processes

- Mathematics
- 1999

In a previous paper (Stidham and Weber [9]), we considered a variety of models for optimal control of the service rate in a queueing system, in which the objective is to minimize the limiting average…

Monotonicity properties of cost functions in queueing networks

- Mathematics, Computer ScienceDiscret. Event Dyn. Syst.
- 1992

It is shown that increasing the initial population and/or the arrival rates increases the expected cost incurred over a finite or an infinite horizon, and this result also applies to networks with communication-type blocking where no jobs are ever lost.

Optimal arrival rate and service rate control of multi-server queues

- Computer ScienceQueueing Syst. Theory Appl.
- 2014

The problem of optimal control of a multi-server queue with controllable arrival and service rates is considered as a continuous-time Markov decision process and structural properties of the optimal control policies under both discounted cost and average cost criterions are derived.

Rate control of a queue with quality-of-service constraint under bounded and unbounded action spaces

- Computer Science
- 2015

This work considers a simple Markovian queue with Poisson arrivals and exponential service times for jobs, and solves the problem of finding and computing the optimal control under two cases: When the action space is unbounded and when it is bounded.

Constrained admission control to a queueing system

- Mathematics
- 1989

We consider an exponential queue with arrival and service rates depending on the number of jobs present in the queue. The queueing system is controlled by restricting arrivals. Typically, a good…

Dynamic Control of a Queue with Adjustable Service Rate

- Computer ScienceOper. Res.
- 2001

A method is presented for computing z* that is so fast and so transparent it may be reasonably described as an explicit solution for the problem of service rate control and are bounded if the holding cost function is bounded.

Strategic Behavior and Social Optimization in Markovian Vacation Queues

- Computer ScienceOper. Res.
- 2011

The strategic response of customers to a single server queueing system in which service shuts down when there are no customers present and is resumed only when the queue length reaches a given critical length is analyzed.

Admission Control in the Presence of Priorities: A Sample Path Approach

- Computer Science
- 2006

This work considers the admission control problem for a two-class-priority M/M/1 queueing system, and analyzes the optimal control policies under three criteria: individual optimization, class optimization, and social optimization.

Strategic behavior and social optimization in Markovian vacation queues: The case of heterogeneous customers

- Computer ScienceEur. J. Oper. Res.
- 2012

It is shown that there may exist multiple equilibria in a single server queueing system in which service shuts down when no customers are present, and is resumed when the queue length reaches a given critical length.

Dynamic admission and service rate control of a queue

- Computer ScienceQueueing Syst. Theory Appl.
- 2010

A single-server queueing system with Poisson arrivals and exponentially distributed services with adjustable rates is examined and it is demonstrated that, in the class of stationary policies, deterministic stationary policies are optimal for this problem.

## References

SHOWING 1-10 OF 33 REFERENCES

OPTIMAL SERVICE-RATE CONTROL OF EXPONENTIAL QUEUEING SYSTEMS

- Mathematics
- 1983

We analyze M/M/l queueing systems with variable service rates under weak cost and probabilistic assumptions by using semi-Markov decision-process formulations. The methods used in studying the…

Optimal control of the service rate in an M/G /1 queueing system

- Mathematics
- 1978

We consider an M/G /1 queue in which the service rate is subject to control. The control is exercised continuously and is based on the observations of the residual workload process. For both the…

OPTIMAL CONTROL OF SERVICE RATES IN NETWORKS OF QUEUES

- Mathematics
- 1987

We prove a monotonicity result for the problem of optimal service rate control in certain queueing networks. Consider, as an illustrative example, a number of -/M/1 queues which are arranged in a…

The Optimality of Full Service Policies

- Computer ScienceOper. Res.
- 1982

It is shown that a full service policy, namely, always using the highest effective service rate, is optimal under general conditions.

On some Control Problems for Queues

- Mathematics
- 1982

This thesis consists of three parts. In the first one, optimal policies are constructed for some singe-line queueing situations. The second part deals with finite-state Markovian decision processes,…

OPTIMAL SERVICE-RATE CONTROL OF M/G/1 QUEUEING SYSTEMS USING PHASE METHODS

- Mathematics
- 1983

A new approach to the optimal control of the service rate in M/G/1 queues is introduced using the method of phases. Each customer's work requirement is approximated by a random number of exponential…

Optimal control of admission to a queueing system

- Computer Science
- 1985

The main emphases are on the difference between socially optimal and individually optimal (equilibrium) controls and on the use of dynamic-programming inductive analysis to show that an optimal control is monotonic or characterized by one or more "critical numbers".

Scheduling, Routing, and Flow Control in Stochastic Networks

- Computer Science
- 1988

This work emphasizes the use of induction on a sequence of successive approximations of the optimal value function (value iteration) to establish the form of optimal control policies.

Applying a New Device in the Optimization of Exponential Queuing Systems

- Computer ScienceOper. Res.
- 1975

A new definition of the time of transition is provided, which is able to utilize the inductive approach in a manner characteristic of inventory theory, and a policy optimal for all sufficiently small discount factors can be obtained from the usual average cost functional equation without recourse to further computation.

ON MONOTONE OPTIMAL POLICIES IN A QUEUEING MODEL OF M/G/1 TYPE WITH CONTROLLABLE SERVICE TIME DISTRIBUTION

- Mathematics
- 1979

A queueing model of M/G/1 type with controllable service time distribution is considered in this paper. Conditions on costs and service time distribution only are established such that there exists a…