首页> 外文期刊>RAIRO Operation Research >A MODIFIED MODELING APPROACH AND A HEURISTIC PROCEDURE FOR THE MULTI-MODE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM WITH ACTIVITY SPLITTING
【24h】

A MODIFIED MODELING APPROACH AND A HEURISTIC PROCEDURE FOR THE MULTI-MODE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM WITH ACTIVITY SPLITTING

机译:具有活动分裂的多模式资源约束项目调度问题的一种改进的建模方法和启发式程序

获取原文
获取原文并翻译 | 示例
           

摘要

This paper presents a new heuristic method for solving multi-mode resource constrained project scheduling problems with renewable resources. Assumptions such as resource vacation and activity splitting are also considered. The proposed heuristic determines one mode for the execution of each activity first, so that the multi-mode problem is reduced to a single-mode one. Our method is compared to two of the existing methods in terms of computational time and solution quality. The results show that while it can outperform one of them (especially as the size of the problem grows), it is outperformed by the other for tested instances with low complexity, but can yield good results for tested instances with higher values of this parameters. This quality may be useful in real-world scheduling problems. We also validate the first phase of our method, i.e., mode selection, with numerical experiments. Our results indicate that better mode vectors selected in the first phase lead to better makespans for the MRCPSP. Moreover, we correct some erroneous constraints in the mathematical model of the problem. We implement the mathematical programming model of the problem in GAMS, and show that solving it to optimality requires much more computational effort compared to our method.
机译:本文提出了一种新的启发式方法,以可再生资源解决多模式资源受限的项目调度问题。还考虑了资源休假和活动拆分等假设。所提出的启发式方法首先确定用于执行每个活动的一种模式,从而将多模式问题简化为单模式问题。在计算时间和解决方案质量方面,我们的方法与两种现有方法进行了比较。结果表明,尽管它可以胜过其中一个(特别是随着问题规模的扩大),但对于复杂度较低的测试实例,它的性能要优于另一个,但是对于具有较高此参数值的测试实例,它可以产生良好的结果。此质量在实际的调度问题中可能很有用。我们还通过数值实验验证了我们方法的第一阶段,即模式选择。我们的结果表明,在第一阶段选择的更好的模式矢量可以为MRCPSP带来更好的制造跨度。此外,我们更正了问题数学模型中的一些错误约束。我们在GAMS中实现了该问题的数学编程模型,并表明与我们的方法相比,将其求解为最优需要大量的计算工作。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号