4.2 Article

On the optimal allocation of service to impatient tasks

Journal

JOURNAL OF APPLIED PROBABILITY
Volume 41, Issue 1, Pages 51-72

Publisher

CAMBRIDGE UNIV PRESS
DOI: 10.1239/jap/1077134667

Keywords

dynamic programming; index policy; Markov decision process; multiclass queue; restless bandit

Ask authors/readers for more resources

Service is often provided in contexts where tasks or customers are impatient or perishable in that they have natural lifetimes of availability for useful service. Moreover, these lifetimes are usually unknown to the service provider. The question of how service might best be allocated to the currently waiting tasks or customers in such a context has been neglected and we propose three simple models. For each model, an index heuristic is developed and is assessed numerically. In all cases studied the heuristic comes close to optimality.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available