CPM机动时间可使用量和使用效率分析
详细信息 查看官网全文
- 英文论文题名：Analysis on Spendable Quantity and Consumptive Efficiency of Float in CPM Network Planning
- 论文作者：魏汉英 ; 苏志雄
- 英文论文作者：WEI Han-ying ; SU Zhi-xiong ; Business Administration College ; Nanchang Institute of Technology
- 年：2016
- 作者机构：南昌工程学院工商管理学院;
- 论文关键词：项目管理 ; CPM网络计划 ; 机动时间可使用量 ; 机动时间使用效率
- 英文论文关键词：project management ; CPM network planning ; spendable quantity of float ; consumptive efficiency of float
- 会议召开时间：2016-11-12
- 会议录名称：第十八届中国管理科学学术年会论文集
- 英文会议录名称：Proceedings of the 18th Chinese Annual Conference on Management Science
- 语种：中文
- 分类号：O157.5
- 学会代码：ZHYJ
- 会议名称：第十八届中国管理科学学术年会
- 会议地点：中国陕西西安
- 主办单位：中国优选法统筹法与经济数学研究会、西安交通大学、中国科学院科技战略咨询研究院、《中国管理科学》编辑部
- 学会名称：中国优选法统筹法与经济数学研究会
- 页数：5
- 文件大小：367k
- 原文格式：O
- 会议级别：全国
摘要
主要解决项目进度计划管理中,CPM机动时间实际可使用量和使用效率问题,以及如何将对机动时间的研究从单个工序扩展到整个网络。首先,根据CPM网络计划已有的知识体系和机动时间已有的概念和性质,提出CPM机动时间可使用量的概念;其次,分析CPM机动时间可使用量与合理分配机动时间的关系,给出求解CPM机动时间可使用量的算法,并相应给出求解其最大值和最小值的算法,证明了算法的正确性;再次,通过对算法的分析,得出任意CPM网络计划的机动时间可使用量会随机动时间分配情况的不同而不同,并非常数;最后,依据CPM机动时间可使用量及其最大值和最小值,定义CPM机动时间的使用效率参数,并给出参数的计算公式和取值范围,分析如何提高CPM网络计划中机动时间使用效率的问题。
This paper is mainly concerned with problems on actual spendable quantity and consumptive efficiency of float in CPM network planning,and how to extend the study on float from single activity to whole network planning.Firstly,according to existent conceptions and characters of float,conception of spendable quantity of float is given.Secondly,relation between CPM spendable quantity of float and distributing float reasonably is analyzed,and algorithms used to calculate CPM spendable quantity of float contains the maximal and minimal values are designed.Thirdly,by analyzing the algorithms,conclusion is given that spendable quantity of float is not constant,which is changing along with circs of distributing float is changing.The lastly,according to CPM spendable quantity of float and its maximal and minimal values,parameter of consumptive efficiency of float is defined,and formula of calculating the parameter and bound of the value are given,and problem of how to advance consumptive efficiency of float in CPM network planning is analyzed.
This paper is mainly concerned with problems on actual spendable quantity and consumptive efficiency of float in CPM network planning,and how to extend the study on float from single activity to whole network planning.Firstly,according to existent conceptions and characters of float,conception of spendable quantity of float is given.Secondly,relation between CPM spendable quantity of float and distributing float reasonably is analyzed,and algorithms used to calculate CPM spendable quantity of float contains the maximal and minimal values are designed.Thirdly,by analyzing the algorithms,conclusion is given that spendable quantity of float is not constant,which is changing along with circs of distributing float is changing.The lastly,according to CPM spendable quantity of float and its maximal and minimal values,parameter of consumptive efficiency of float is defined,and formula of calculating the parameter and bound of the value are given,and problem of how to advance consumptive efficiency of float in CPM network planning is analyzed.
引文
[1]Kelley J E,Walker M R.Criticalpath planning and scheduling[C].//Proceedings of the Eastern Joint Computational Conference,Boston,December 1-3,1959,16.
[2]蔡晨,万伟.基于PERT/CPM的关键链管理[J].中国管理科学,2003,11(6):35-39.
[3]Peng Wuliang,Huang Min.A critical chain project scheduling method based on a differential evolution algorithm[J].International Journal of Production Research,2014,52(13):3940-3949.
[4]Jose L P T,Eugenio P,Javier B M,et al.The fuzzy project scheduling problem with minimal generalized precedence relations[J].Computer-Aided Civil and Infrastructure Engineering,2015,30(11):872-891.
[5]Bianco L,Caramia M,Giordani S.Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities[J].OR Spectrum,2016,38(2):405-425.
[6]苏志雄,乞建勋,王强.求解广义优先关系下的项目最小费用问题[J].管理科学学报,2013,16(11):42-
[7]Elmaghraby S E.Activitynetworks:Project planning and control by network models[M].New York:John Wiley&Sons Inc.,1977.
[8]Demeulemeester E L,Herrlelen WS.Project Scheduling[M].Boston:Kluwer Academic Publishers,2002.
[9]Elmaghraby S E.Activitynets:a guided tour through some recent developments[J].European Journal of Operational Research,1995,82:383-408.
[10]乞建勋,张立辉,李星梅.网络计划管理中的机动时间特性及其应用[M].北京:科学出版社,2009.
[11]李星梅,乞建勋,苏志雄.基于时差分析的资源均衡问题探究[J].中国管理科学,2007,15(1):47-54.
[12]李星梅,乞建勋.基于时差分析的时标网络图研究[J].运筹与管理,2006,15(6):28-33.
[13]张立辉,邹鑫,乞建勋.基于逆控制工序的重复性项目最短工期计算方法[J].中国管理科学,2015,23(9):171-176.
[14]何正文,刘人镜,胡信布.基于合同双方交互作用的项目调度优化[J].管理科学学报,2014,17(8):48-59.
[15]白思俊.资源有限网络计划启发式方法的评价(上)——理论分析与试验设计[J].运筹与管理,1999,8(2):6-11.
[16]白思俊.资源有限网络计划启发式方法的评价(中)——启发式方法的综合比较和评价[J].运筹与管理,1999,8(3):51-56.
[17]白思俊.资源有限网络计划启发式方法的评价(下)——启发式方法与网络特征的相关性分析[J].运筹与管理,1999,8(4):52-56.
[18]Zhang Lihui,Pan Chuyun,Zou Xin.Criticality comparison between repetitive scheduling method and network model[J].Journal of Construction Engineering and Management,2013,139(10):5971-5984.
[19]Elmaghraby S E.On criticality and sensitivity in activity networks[J].European Journal of Operational Research,2000,127(2):220-238.
[20]李星梅,乞建勋,苏志雄,等.基于机动时间的项目工期单因素不确定性分析[J].北京航空航天大学学报,2007,33(12):1466-1470.
[2]蔡晨,万伟.基于PERT/CPM的关键链管理[J].中国管理科学,2003,11(6):35-39.
[3]Peng Wuliang,Huang Min.A critical chain project scheduling method based on a differential evolution algorithm[J].International Journal of Production Research,2014,52(13):3940-3949.
[4]Jose L P T,Eugenio P,Javier B M,et al.The fuzzy project scheduling problem with minimal generalized precedence relations[J].Computer-Aided Civil and Infrastructure Engineering,2015,30(11):872-891.
[5]Bianco L,Caramia M,Giordani S.Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities[J].OR Spectrum,2016,38(2):405-425.
[6]苏志雄,乞建勋,王强.求解广义优先关系下的项目最小费用问题[J].管理科学学报,2013,16(11):42-
[7]Elmaghraby S E.Activitynetworks:Project planning and control by network models[M].New York:John Wiley&Sons Inc.,1977.
[8]Demeulemeester E L,Herrlelen WS.Project Scheduling[M].Boston:Kluwer Academic Publishers,2002.
[9]Elmaghraby S E.Activitynets:a guided tour through some recent developments[J].European Journal of Operational Research,1995,82:383-408.
[10]乞建勋,张立辉,李星梅.网络计划管理中的机动时间特性及其应用[M].北京:科学出版社,2009.
[11]李星梅,乞建勋,苏志雄.基于时差分析的资源均衡问题探究[J].中国管理科学,2007,15(1):47-54.
[12]李星梅,乞建勋.基于时差分析的时标网络图研究[J].运筹与管理,2006,15(6):28-33.
[13]张立辉,邹鑫,乞建勋.基于逆控制工序的重复性项目最短工期计算方法[J].中国管理科学,2015,23(9):171-176.
[14]何正文,刘人镜,胡信布.基于合同双方交互作用的项目调度优化[J].管理科学学报,2014,17(8):48-59.
[15]白思俊.资源有限网络计划启发式方法的评价(上)——理论分析与试验设计[J].运筹与管理,1999,8(2):6-11.
[16]白思俊.资源有限网络计划启发式方法的评价(中)——启发式方法的综合比较和评价[J].运筹与管理,1999,8(3):51-56.
[17]白思俊.资源有限网络计划启发式方法的评价(下)——启发式方法与网络特征的相关性分析[J].运筹与管理,1999,8(4):52-56.
[18]Zhang Lihui,Pan Chuyun,Zou Xin.Criticality comparison between repetitive scheduling method and network model[J].Journal of Construction Engineering and Management,2013,139(10):5971-5984.
[19]Elmaghraby S E.On criticality and sensitivity in activity networks[J].European Journal of Operational Research,2000,127(2):220-238.
[20]李星梅,乞建勋,苏志雄,等.基于机动时间的项目工期单因素不确定性分析[J].北京航空航天大学学报,2007,33(12):1466-1470.