| Article ID: | iaor20105599 |
| Volume: | 58 |
| Issue: | 4-Part-1 |
| Start Page Number: | 1023 |
| End Page Number: | 1027 |
| Publication Date: | Jul 2010 |
| Journal: | Operations Research |
| Authors: | Jacobson Sheldon H, Nikolaev Alexander G |
| Keywords: | scheduling |
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.