期刊文献+

基于鲁棒性的离散时间—费用权衡项目调度

Robustness-based discrete time/cost trade-off project scheduling
下载PDF
导出
摘要 针对传统离散—时间费用权衡项目调度问题(DTCTP)中忽略活动工期波动的问题,从鲁棒优化角度考虑调整调度方案的灵活性。将DTCTP中的预算问题(DTCTP-P2)拓展为基于项目工期和鲁棒性的双目标模型DTCTP-Robustness,设计了专用的多目标精确枚举排序算法求解DTCTP-Robustness,算法逐个检查可行解,并采用基于双目标的Pareto解集合保存和更新策略。通过求解算例,分析在不同费用约束下,5种鲁棒性指标和工期组合下所对应的各个Pareto最优解集合;在相同的总费用约束下,比较DTCTP-Robustness和DTCTP-P2两种模型的最优解的差别。结果表明,项目经理在不确定环境下进行工期-费用权衡决策时,DTCTP-Robustness提供的信息比DTCTP-P2更客观。 Aiming at the problem that the duration fluctuations of activities were almost ignored in the classic Discrete Time/Cost Trade-off Project (DTCTP) scheduling,the flexibility of scheduling scheme was adjusted from the perspective of robust optimization.A new bi-objective model-DTCTP-Robustness based on project duration and robustness was presented by expanding the DTCTP-P2 (budget problem),and a special exact enumeration sorting algorithm was developed to solve the DTCTP-Robustness,in which all feasible solutions were checked one by one,and the strategy for the bi-objective model was executed to preserve and update the Pareto solutions set.Through the solving example,the Pareto optimal solution sets were analyzed according to five combinations of project duration and robust measures under the different cost constraints.The difference between the optimal solution of DTCTP-Robustness and DTCTP-P2 models were contrasted within the same budget constraint.The conclusion showed that the DTCTP-P2 could provide more objective information than the DTCTP-P2 when project managers made the duration/cost trade-off of projects under the uncertain environment.
出处 《计算机集成制造系统》 EI CSCD 北大核心 2013年第11期2884-2892,共9页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(70702026) 陕西省自然科学基金资助项目(2011JQ9001) 西北工业大学管理振兴资助项目(RW201005)~~
关键词 鲁棒性 项目调度 时间—费用权衡 Pareto精确算法 robustness project scheduling time/cost trade-off Pareto exact algorithm
  • 相关文献

参考文献3

二级参考文献75

  • 1张静文,徐渝,何正文,柴国荣.项目调度中的时间-费用权衡问题研究综述[J].管理工程学报,2007,21(1):92-97. 被引量:24
  • 2张静文,徐渝,柴国荣.项目进度中的离散时间-费用决策问题研究[J].系统工程学报,2007,22(2):122-127. 被引量:10
  • 3HINDELANG T J, MUTH J F. A dynamic programming algorithm for decision CPM networks[J]. Operations Research, 1979, 27(2) :225-241. 被引量:1
  • 4PRABUDDHA D E, DUNNE E J, GHOSH J B, et al. Complexity of the discrete time-cost tradeoff problem for project networks[J].Operations Research, 1997, 45(2) :302-306. 被引量:1
  • 5DEINEKO V G,WOEGINGER G J. Hardness of approximation of the discrete time cost tradeoff prohlem[J].Operations Research Letters, 2001, 29 (5) :207-210. 被引量:1
  • 6PATTERSON J H, HARVEY R T. An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis[J]. Foundations of Control Engineering, 1979, 4(2):107-117. 被引量:1
  • 7DEMEULEMEESTER E, HERROELEN W, ELMAGHRABY S E. Optimal procedures for the discrete time/cost trade off problem in project networks[J]. European Journal of Operational Research, 1996, 88(1) :50-68. 被引量:1
  • 8DEMEULEMEESTER E, DE REYCK B, FOUBERT B, et al. New computational results on the discrete time/cost trade -off problem in project networks[J]. Journal of the Operational Research Society, 1998, 49(6):1153-1163. 被引量:1
  • 9ERENGUC S S, AHN T, CONWAY D G. The resource constrained project scheduling problem with multiple crashable modes: an exact solution method[J]. Naval Research Logistics, 2001, 48(2):107-127. 被引量:1
  • 10SKUTELLA M. Approximation algorithms for the discrete time-cost tradeoff problem[J]. Mathematics of Operations Research, 1998, 23(4) :909-929. 被引量:1

共引文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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