检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机集成制造系统》2011年第7期1534-1540,共7页Computer Integrated Manufacturing Systems
摘 要:为了解决多项目管理中面临的诸多不确定性问题,提出了关键链多项目管理法中确定能力约束缓冲大小的新方法。阐述了使用鼓资源的活动网络特点及其与单项目管理中接驳链的不同之处。综合考虑了鼓资源紧张度、鼓网络复杂度和鼓活动间隙度三个因素对能力约束缓冲大小的影响。采用具体算例,同50%法和不考虑鼓活动间隙度法进行了比较。模拟结果表明,该方法计算的缓冲更小,仍能够以较高的可能性提供足够的错开时间,保证了项目群较高的最终完工率,从而验证了所提方法的有效性和实用性。To solve the various uncertainty problems in multi-project management,a new method to determine the capacity constraints buffer size was proposed in critical chain multi-project scheduling.The network characteristics of drum activities and difference between drum activities and activities on the feeding chain were discussed.Effects of drum resource tightness,drum network complexity and drum space interval were considered and integrated in this method.A simulation experiment was carried out to demonstrate application of the proposed method.Comparison of the proposed method with the cut and paste method and the approach without incorporating drum space interval were performed.The result showed that the suggested method generated smaller buffer size while providing the sufficient staggered time and almost the same on-time completion rate of the whole projects.Thus,the effectiveness and practicability of the proposed method were validated.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28