检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学管理学院
出 处:《系统工程理论与实践》2018年第1期102-112,共11页Systems Engineering-Theory & Practice
基 金:国家自然科学基金(71271097)~~
摘 要:针对工期不确定的资源受限项目调度问题,将鲁棒性资源分配和时间缓冲插入两种方法进行有效地结合,通过设计两阶段集成优化算法构建抗干扰能力较强的鲁棒性项目调度计划.第一阶段提出MEPC(minimizing expected penalty cost)资源流网络优化算法,通过对资源进行有效配置生成稳定的资源流网络.为进一步提升调度计划的鲁棒性,第二阶段通过固定第一阶段构建的资源流网络,设计EPC(expected penalty cost)缓冲优化算法,通过迭代方式在延期风险较大的活动前插入时间缓冲,实现项目期望惩罚成本最小化.最后通过大规模仿真实验从“解”鲁棒性“质”鲁棒性两方面来验证两阶段算法的有效性和可行性,结果表明通过将资源流网络与时间缓冲进行集成优化构建的调度计划不仅具有较好的完工性并且能更有效地应对项目执行过程中各种不确定性因素的干扰.For solving the resource constrained project scheduling problem (RCPSP) with stochastic durations, robust resource allocation and time buffer insertion are combined effectively. A two-stage integrated optimization algorithm is proposed to generate robust project schedules against disruptions. In the first stage, a myopic expected penalty cost (MEPC) procedure is designed to construct a stable resource flow network by efficiently ailocating resources among project activities. To further improve the schedule stability, an expected penalty cost (EPC) algorithm that relies on the fixed resource flow network is proposed in the second stage to minimize the expected penalty cost through inserting time buffers in front of the activities with higher delay risks. Finally, extensive computational experiments are performed to verify the feasibility and effectiveness of the two-stage algorithm from two aspects of solution robustness and quality robustness. The results indicate that the project schedule generated by the integration of the resource flow network and time buffers not only can achieve shorter completion times, but also can deal with disruptions more effectively during project execution.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.124.105