Gateway to Think Tanks
来源类型 | Monograph (IIASA Research Report (Reprint)) |
规范类型 | 报告 |
A Stochastic Approach to Hierarchical Planning and Scheduling. | |
Dempster MAH | |
发表日期 | 1984 |
出版者 | IIASA, Laxenburg, Austria: RR-84-006. |
出版年 | 1984 |
语种 | 英语 |
摘要 | This paper surveys recent results for stochastic discrete programming models of hierarchical planning problems. Practical problems of this nature typically involve a sequence of decision over time at an increasing level of detail and with increasingly accurate information. These may be modeled by multistage stochastic programs whose lower levels (later stages) are stochastic versions of similar NP-hard deterministic combinatorial optimization problems and hence require the use of approximations and heuristics for near-optimal solution. After a brief survey of distributional assumptions on processing times under which SEPT and LEPT policies remain optimal for m-machine scheduling problems, results are presented for various 2-level scheduling problems in which the first stage concerns the acquisition (or assignment) of machines. For example, heuristics which are asymptotically optimal in expectation as the number of jobs in the system increases are analyzed for problems whose second stages are either identical or uniform m-machine scheduling problems. A 3-level location, distribution and routing model in the plane is also discussed. |
主题 | System and Decision Sciences - Core (SDS) |
URL | http://pure.iiasa.ac.at/id/eprint/2406/ |
来源智库 | International Institute for Applied Systems Analysis (Austria) |
资源类型 | 智库出版物 |
条目标识符 | http://119.78.100.153/handle/2XGU8XDN/122970 |
推荐引用方式 GB/T 7714 | Dempster MAH. A Stochastic Approach to Hierarchical Planning and Scheduling.. 1984. |
条目包含的文件 | ||||||
文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
RR-84-06.pdf(9366KB) | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Dempster MAH]的文章 |
百度学术 |
百度学术中相似的文章 |
[Dempster MAH]的文章 |
必应学术 |
必应学术中相似的文章 |
[Dempster MAH]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。