Resource Allocation: An Optimum-Seeking Approach under the Uncertainty for PERT

被引：0
|
作者：
Li Changqing [1 ]
Zhang Mang [2 ]
机构：
[1] Inner Mongolia Univ Technol, Sch Management, Hohhot 010051, Peoples R China
[2] Inner Mongolia Univ Technol, Grad Sch Management, Hohhot 010051, Peoples R China
来源：
APPLIED INFORMATICS AND COMMUNICATION, PT I | 2011年 / 224卷
基金：
中国国家自然科学基金;
关键词：
Indeterminacy; Resource allocation; Coefficient of variation; An optimum-seeking approach;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
on the basis of Resource optimum-seeking approach, the article estimate earliest finish time, optimistic time and pessimistic time and calculate expectation and variance of each process. The resource allocation problem can be resolved by using the "branch-and-bound" algorithm. The article explores how to choose path with the different expectation and variance, Especially, the problem can be resolve by coefficient of variation. The method can overcome the subjectivity which comes from personal preference options.
引用
收藏
页码：714 / +
页数：2
相关论文
共 50 条
12345