Index Policies for Shooting Problems

2006 ◽  
Author(s):  
K. D. Glazebrook ◽  
C. Kirkbride ◽  
H. M. Mitchell ◽  
D. P. Gaver ◽  
P. A. Jacobs
Keyword(s):  
Index Policies

On transforming an index for generalised bandit problems

1995 ◽  
Vol 32 (1) ◽  
pp. 168-182 ◽  
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.

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

1996 ◽  
Vol 44 (4) ◽  
pp. 634-647 ◽  
Author(s):  
Michael H. Veatch ◽  
Lawrence M. Wein
Keyword(s):  
Index Policies ◽  
Make To Stock

scholarly journals Optimality of index policies for stochastic scheduling with switching penalties

1992 ◽  
Vol 29 (04) ◽  
pp. 957-966 ◽  
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.

Dual-index Policies for Serial Systems with Dual Delivery Modes and Batch Orders

2019 ◽  
Author(s):  
Jie Wu ◽  
Qiang Wang ◽  
Chaolin Yang ◽  
Yi Yang
Keyword(s):  
Delivery Modes ◽  
Index Policies

Optimal myopic policies and index policies for stochastic scheduling problems

1994 ◽  
Vol 40 (1) ◽  
pp. 75-89 ◽  
Author(s):  
J�rgen Weishaupt
Keyword(s):  
Stochastic Scheduling ◽  
Scheduling Problems ◽  
Index Policies ◽  
Myopic Policies

OPTIMAL TASK OFFLOADING IN FOG-ENABLED NETWORKS VIA INDEX POLICIES

2018 ◽  
Author(s):  
Fuqian Yang ◽  
Zhaowei Zhu ◽  
Shangshu Zhao ◽  
Yang Yang ◽  
Xiliang Luo
Keyword(s):  
Index Policies ◽  
Task Offloading

Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management

2004 ◽  
Vol 29 (1) ◽  
pp. 162-181 ◽  
Author(s):  
Eric V. Denardo ◽  
Uriel G. Rothblum ◽  
Ludo Van der Heyden
Keyword(s):  
Project Management ◽  
Stochastic Search ◽  
Index Policies

scholarly journals Optimal Index Policies for Anomaly Localization in Resource-Constrained Cyber Systems

2014 ◽  
Vol 62 (16) ◽  
pp. 4224-4236 ◽  
Author(s):  
Kobi Cohen ◽  
Qing Zhao ◽  
Ananthram Swami
Keyword(s):  
Resource Constrained ◽  
Index Policies
Sign in / Sign up

Export Citation Format

Share Document