检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学管理学院,湖北武汉430074 [2]武汉理工大学物流工程学院,湖北武汉430063
出 处:《工业工程》2015年第2期127-132,141,共7页Industrial Engineering Journal
基 金:国家自然科学基金资助项目(71271097);国家自然科学基金青年科学基金资助项目(71201119)
摘 要:加入接驳缓冲后可能导致关键链与非关键链产生资源冲突,非关键链溢出等问题,使得关键链调度计划的制定再次复杂化。为优化接驳缓冲的计算,在根方差法的基础上,运用独立时差这一项目网络提供的隐性安全时间,区分非关键链上的活动;并对非关键链上拥有独立时差的活动,改变Goldratt提出的所有非关键活动最晚执行策略,构建考虑独立时差的接驳缓冲设置方法。通过仿真实验,对采用不同接驳缓冲设置法得到的关键链调度计划进行比较;结果表明,新方法能减少接驳缓冲设置引发的问题,并较好地改善了项目工期,项目执行绩效。Inserting feeding buffer in non-critical chain may lead to new problems, such as new resource conflict, non-critical chain overflow, etc. These problems further complicate the resource constrained pro- ject scheduling. In order to optimize the sizing of feeding buffer, based on root square error method (RSEM) , independent float is applied to solve the feeding buffer setting in critical chain project manage- ment theory. Using independent float wish is the hidden safety time in project network, the activities on non-critical chain are differentiated. Aiming at the non-critical activities which have independent float, and changing the latest time execution strategy proposed by Goldratt, the new feeding buffer sizing ap- proach is built. At the end, experimentation of different plans using various feeding buffer sizing methods has been done by means of simulation for contrastive analysis. Results show that the new approach reduces the problems caused by the feeding buffer inserting and improves the due date and execution performance of project.
分 类 号:C935[经济管理—管理学] C94[自然科学总论—系统科学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.239.69