Translator Disclaimer
December 2014 Limiting behavior of the target-dependent stochastic sequential assignment problem
Golshid Baharian, Sheldon H. Jacobson
Author Affiliations +
J. Appl. Probab. 51(4): 943-953 (December 2014).

Abstract

The stochastic sequential assignment problem assigns distinct workers to sequentially arriving tasks with stochastic parameters. In this paper the assignments are performed so as to minimize the threshold probability, which is the probability of the long-run reward per task failing to achieve a target value (threshold). As the number of tasks approaches infinity, the problem is studied for independent and identically distributed (i.i.d.) tasks with a known distribution function and also for tasks that are derived from r distinct unobservable distributions (governed by a Markov chain). Stationary optimal policies are presented, which simultaneously minimize the threshold probability and achieve the optimal long-run expected reward per task.

Citation

Download Citation

Golshid Baharian. Sheldon H. Jacobson. "Limiting behavior of the target-dependent stochastic sequential assignment problem." J. Appl. Probab. 51 (4) 943 - 953, December 2014.

Information

Published: December 2014
First available in Project Euclid: 20 January 2015

zbMATH: 1326.60132
MathSciNet: MR3301281

Subjects:
Primary: 60K30
Secondary: 60J20

Rights: Copyright © 2014 Applied Probability Trust

JOURNAL ARTICLE
11 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.51 • No. 4 • December 2014
Back to Top