检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机集成制造系统》2013年第11期2884-2892,共9页Computer Integrated Manufacturing Systems
基 金:国家自然科学基金资助项目(70702026);陕西省自然科学基金资助项目(2011JQ9001);西北工业大学管理振兴资助项目(RW201005)~~
摘 要:针对传统离散—时间费用权衡项目调度问题(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.
关 键 词:鲁棒性 项目调度 时间—费用权衡 Pareto精确算法
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.40