Journal
OPERATIONS RESEARCH
Volume 58, Issue 4, Pages 1023-1027Publisher
INFORMS
DOI: 10.1287/opre.1090.0778
Keywords
-
Funding
- U.S. Air Force Office of Scientific Research [FA9550-07-1-0232]
- National Science Foundation [CMMI-0900226]
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [0900226] Funding Source: National Science Foundation
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
