...
首页> 外文期刊>European Journal of Operational Research >A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
【24h】

A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem

机译:抢占式和非抢占式多模式资源受限项目调度问题的遗传算法

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

摘要

In this paper we present a genetic algorithm for the multi-mode resource-constrained project scheduling problem (MRCPSP), in which multiple execution modes are available for each of the activities of the project. We also introduce the preemptive extension of the problem which allows activity splitting (P-MRCPSP). To solve the problem, we apply a bi-population genetic algorithm, which makes use of two separate populations and extend the serial schedule generation scheme by introducing a mode improvement procedure. We evaluate the impact of preemption on the quality of the schedule and present detailed comparative computational results for the MRCPSP, which reveal that our procedure is amongst the most competitive algorithms.
机译:在本文中,我们提出了一种用于多模式资源受限项目调度问题(MRCPSP)的遗传算法,其中针对项目的每个活动都可以使用多种执行模式。我们还介绍了该问题的抢先扩展,它允许活动拆分(P-MRCPSP)。为了解决该问题,我们应用了双种群遗传算法,该算法利用两个单独的种群,并通过引入模式改进程序来扩展串行计划生成方案。我们评估了抢占对时间表质量的影响,并给出了MRCPSP的详细比较计算结果,这表明我们的程序是最具竞争力的算法之一。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号