期刊文献+

基于学习效应及时间转换约束双重作用下项目网络模型研究 被引量:2

The Project Network with Learning Effect and Time-Switch Constraints
下载PDF
导出
摘要 具有时间转化约束项目网络是对传统网络的创新,其考虑了时间转换约束对项目网络的影响。但是,在已有时间转换约束项目网络的研究过程中都是假设在整个工期内工作效率是固定不变的,忽略了人为因素。而人在工作过程中具有学习效应,即随着时间的推移人由对活动的生疏逐渐到能够熟练完成活动,在这个过程中工作效率也有了很大的提高。本文在前人研究的基础上,考虑了人的行为因素对具有时间转换约束网络的影响,给出了在人的学习效应和时间转换约束双重作用下的机动时间的计算公式,进而给出工序持续时间的计算公式,并在此基础上建立了网络关键线路的变化模型。最后,通过实例验证了该模型的有效性和合理性。 Network planning technique is an important method in the field of project management. The technique is critical for actual projects. The existing researches mostly focus on the research of float activities with the assumption that current activities can start alter precedence activities come to an end. However, in the actual project a large quantity of activities are restricted by the start time, which leads to the impossibility of an activity starting at any time satisfying the constraints of precedence relations. The project network with the time-switch constraints can solve this problem in the traditional network. The project network with time-switch constraints takes into account of the influence of the time-switch constraints. However, in existing researches this method assumes that the work efficiency of the activity is fixed in the whole duration which ignores the fluctuation of human factors. The learning effect is that as time goes on people are able to gradually complete activities from the unfamiliar state to the familiar one. Work efficiency has been greatly improved in this process over time. We arc especially interested in the learning effect which mainly refers to the change of work efficiency caused by repetitive activities. No researches consider applying the learning effect to the projects with time-switch constraints at present. In this paper, we use learning efficiency to represent the impact of work efficiency on the project with time-switch constraints. As a result, the theory related to the project network with time-switch constraints is enhanced. Based on the research for project network with time-switch constraints, we analyzed the impact of time-switch constraints and learning effect on project network. The formula for network float influenced by these two factors is presented. The duration formula for each activity is proposed in this context. At last, we build a model to calculate the critical path of the network. We begin the first part by introducing the existing research of the learning effect and project network with time-switch constraints. In this section, we propose that the learning effect mainly focuses on the improvement of learning rate and lowering production cost. No research considers applying the learning effect to the project with time-switch constraints. In Section 2, we build the model of project network with time-switch constraints and propose the formula of the above network. According the formula, we quantify network with time-switch constraints with the change of duration and effect on each activity float. In the third part, we analyzes the project network with time-switch constraints and learning effect, and build the model of project network with time-switch constraints and learning effect based on the existing model. In the end of this section, we modify activity duration in the new model. In the last part, a project from the pertinent literature is used as an example. Because of the learning effect, both the duration and the critical path are changed in project network with time-switch constraints model.
出处 《管理工程学报》 CSSCI 北大核心 2015年第2期63-69,共7页 Journal of Industrial Engineering and Engineering Management
基金 国家自然科学基金资助项目(71171079 61105127) 中央高校基本科研经费资助项目(11QR36)
关键词 时间转换约束 学习效应 工作效率 人为因素 time=switch constraints learning effect work efficiency human factors
  • 相关文献

参考文献14

  • 1Hershaur J C, Nabielsky G. Estimating activity times [J]. Journal of System Management, 1972, 23(9): 17-21.
  • 2Keefer D L, Verdini W A. Better estimation of PERT activity time parameters [J]. Management Science, 1993, 39(9): 1086-1091.
  • 3Abbasi GY, Mukattash AM. Crashing PERT networks using mathematical programming [J]. International Journal of Project Management 2001, 19(3): 181-188.
  • 4刘春林,陈华友.区间数计划网络的关键路问题研究[J].管理科学学报,2006,9(1):27-32. 被引量:15
  • 5乞建勋. 网络规划及技术经济决策新理论[M]. 北京: 北京科学出版社, 1997.
  • 6Chen YL, Rinks D, Tang K. Critical Path in an activity network with time constraints [J]. European Journal of Operational Research, 1997, 100: 122-133.
  • 7Yang HH, Chen YL. Finding the critical path in an activity network with time-switch constraints [J]. European Journal of Operational Research, 2000, 120(3): 603-613.
  • 8Vanhoucke M. New computational results for the discrete time/cost trade-off problem with time-switch constraints [J]. European Journal of Operational Research, 2005,162(2): 359-374.
  • 9张静文,徐渝,何正文.具有时间转换约束的离散时间-费用权衡问题研究[J].中国管理科学,2006,14(2):58-64. 被引量:6
  • 10张静文,徐渝.具有时间转换约束的项目网络分析方法研究[J].系统工程理论与实践,2005,25(7):26-34. 被引量:5

二级参考文献35

  • 1张静文,徐渝.具有时间转换约束的项目网络分析方法研究[J].系统工程理论与实践,2005,25(7):26-34. 被引量:5
  • 2陈建华,林鸣,马士华.基于过程管理的工程项目多目标综合动态调控机理模型[J].中国管理科学,2005,13(5):93-99. 被引量:31
  • 3Chae K C, Kim S. Estimating the mean and variance of PERT activity time using likelihood-ration of the mode and midpoint[J]. IIE Transactions,1990,22(3):198-203.
  • 4Hershaur J C, Nabielsky G. Estimating activity times[J]. Journal of System Management,1972,23(9):17-21.
  • 5Keefer D L, Verdini W A. Better estimation of PERT activity time parameters[J].Management Science,1993,39(9):1086-1091.
  • 6Magott, Skudlarski K. Estimating the mean completion time of PERT networks with exponentially distribution duration of activities[J].European Journal of Operational Research,1993,71(1):70-79.
  • 7Nadas A. Probabilistic PERT[J]. IBM Journal of Research and Development,1979,23(3):339-347.
  • 8Soroush S. Risk taking in stochastic PERT networks[J]. European Journal of Operational Research,1993,67(2):221-241.
  • 9Williams T M. Criticality in stochastic networks[J].Journal of the Operational Research Society,1992,43(4):353-357.
  • 10Yang H H,Chen Y L. Finding the critical path in an activity network with time-switch constraints[J]. European Journal of Operational Research ,2000,120:603-613.

共引文献22

同被引文献27

  • 1彭武良,王成恩.关键链项目调度模型及遗传算法求解[J].系统工程学报,2010,25(1):123-131. 被引量:33
  • 2贾海红,苏志雄,李星梅.工序机动时间的传递性和稳定性分析[J].中国管理科学,2008,16(S1):147-151. 被引量:2
  • 3Guerriero F, Talarico L. A solution approach to find the critical path in a time-constrained activity network[J]. Computer & Operations Research, 2010, 37(9) : 1557- 1569.
  • 4Yang H H, Chen Y L. Finding the critical path in an activity network with time-switch constraints[J]. Euro- pean Journal of Operational Research, 2000, 120(3): 603-613.
  • 5Parikh S C, Jewell W S. Decomposition of project net- works[J]. Management Science, 1965, 11(3): 444- 459.
  • 6李敏芝.一种处理PERT的计算机方法[J].系统工程与电子技术,1983,(8):60-64.
  • 7Muller J H, Spinrad J. Incremental modular decompo- sition[J]. Journal of the ACM, 1989, 36(1): 1-19.
  • 8Obreque C, Donoso M, Gutiorrez G, et al. A branch and cut algorithm for the hierarchical network design problem[J]. European Journal of Operational Re- search, 2010, 200(1): 28-35.
  • 9Obreque C, Marianov V, Rios M. Optimal design of hierarchical networks with Hee main path extremes[J]. Operations Research Letters, 2008, 36 (3) : 366- 371.
  • 10Obreque C, Marianov V. An optimal procedure for sol- ving the hierarchical network design problem[J]. IIE Transactions, 2007, 39(5): 513-524.

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部