期刊
OPERATIONS RESEARCH
卷 58, 期 4, 页码 1023-1027出版社
INFORMS
DOI: 10.1287/opre.1090.0778
关键词
-
资金
- 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
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据