Index Policies for Shooting Problems

On transforming an index for generalised bandit problems

Journal of Applied Probability ◽

10.2307/3214927 ◽

1995 ◽

Vol 32 (1) ◽

pp. 168-182 ◽

Cited By ~ 4

Author(s):

K. D. Glazebrook ◽

S. Greatrix

Keyword(s):

Dynamic Programming ◽

Policy Evaluation ◽

Gittins Index ◽

Bandit Problem ◽

Bandit Problems ◽

Index Policies

Nash (1980) demonstrated that index policies are optimal for a class of generalised bandit problem. A transform of the index concerned has many of the attributes of the Gittins index. The transformed index is positive-valued, with maximal values yielding optimal actions. It may be characterised as the value of a restart problem and is hence computable via dynamic programming methodologies. The transformed index can also be used in procedures for policy evaluation.

Download Full-text

Scheduling a Make-To-Stock Queue: Index Policies and Hedging Points

Operations Research ◽

10.1287/opre.44.4.634 ◽

1996 ◽

Vol 44 (4) ◽

pp. 634-647 ◽

Cited By ~ 98

Author(s):

Michael H. Veatch ◽

Lawrence M. Wein

Keyword(s):

Index Policies ◽

Make To Stock

Download Full-text

Optimality of index policies for stochastic scheduling with switching penalties

Journal of Applied Probability ◽

10.1017/s0021900200043825 ◽

1992 ◽

Vol 29 (04) ◽

pp. 957-966 ◽

Cited By ~ 2

Author(s):

Mark P. Van Oyen ◽

Dimitrios G. Pandelis ◽

Demosthenis Teneketzis

Keyword(s):

Optimal Policy ◽

Time Delays ◽

Stochastic Scheduling ◽

Optimal Scheduling ◽

Scheduling Policies ◽

Parallel Queues ◽

Lump Sum ◽

Index Policies ◽

Service Policy ◽

The Impact

We investigate the impact of switching penalties on the nature of optimal scheduling policies for systems of parallel queues without arrivals. We study two types of switching penalties incurred when switching between queues: lump sum costs and time delays. Under the assumption that the service periods of jobs in a given queue possess the same distribution, we derive an index rule that defines an optimal policy. For switching penalties that depend on the particular nodes involved in a switch, we show that although an index rule is not optimal in general, there is an exhaustive service policy that is optimal.

Download Full-text