Stochastic sequential decision-making with a random number of jobs
AG Nikolaev, SH Jacobson - Operations Research, 2010 - pubsonline.informs.org
Operations Research, 2010•pubsonline.informs.org
This paper addresses a class of problems in which available resources need to be optimally
allocated to a random number of jobs with stochastic parameters. Optimal policies are
presented for variations of the sequential stochastic assignment problem and the dynamic
stochastic knapsack problem, in which the number of arriving jobs is unknown until after the
final arrival, and the job parameters are assumed to be independent but not identically
distributed random variables.
allocated to a random number of jobs with stochastic parameters. Optimal policies are
presented for variations of the sequential stochastic assignment problem and the dynamic
stochastic knapsack problem, in which the number of arriving jobs is unknown until after the
final arrival, and the job parameters are assumed to be independent but not identically
distributed random variables.
This paper addresses a class of problems in which available resources need to be optimally allocated to a random number of jobs with stochastic parameters. Optimal policies are presented for variations of the sequential stochastic assignment problem and the dynamic stochastic knapsack problem, in which the number of arriving jobs is unknown until after the final arrival, and the job parameters are assumed to be independent but not identically distributed random variables.
INFORMSShowing the best result for this search. See all results