• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Principles and practice of constraint programming >Modeling and Solving Project Scheduling with Calendars
【24h】

Modeling and Solving Project Scheduling with Calendars

机译：使用日历建模和解决项目计划

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Resource-constrained project scheduling with the objective of minimizing project duration (RCPSP) is one of the most studied scheduling problems. In this paper we consider the RCPSP with general temporal constraints and calendar constraints. Calendar constraints make some resources unavailable on certain days in the scheduling period and force activity execution to be delayed while resources are unavailable. They arise in practice from, e.g., unavailabilities of staff during public holidays and weekends. The resulting problems are challenging optimization problems. We develop not only four different constraint programming (CP) models to tackle the problem, but also a specialized propagator for the cumulative resource constraints taking the calendar constraints into account. This propagator includes the ability to explain its inferences so it can be used in a lazy clausie generation solver. We compare these models, and different search strategies on a challenging set of benchmarks using a lazy clause generation solver. We close 83 of the open problems of the benchmark set, and show that CP solutions are highly competitive with existing M_(IP) models of the problem.
机译：以最小化项目工期（RCPSP）为目标的资源受限的项目调度是研究最多的调度问题之一。在本文中，我们考虑具有一般时间约束和日历约束的RCPSP。日历限制使某些资源在计划期间的某些天不可用，并在资源不可用时强制延迟活动执行。实际上，它们是由于例如在公共假日和周末工作人员的空缺而引起的。所产生的问题是对优化问题的挑战。我们不仅开发了四种不同的约束编程（CP）模型来解决该问题，而且还开发了一种专门的传播器，用于考虑日历约束的累积资源约束。该传播器具有解释其推论的能力，因此可以在懒惰的克劳斯代求解器中使用。我们使用惰性子句生成求解器在具有挑战性的一组基准上比较这些模型和不同的搜索策略。我们关闭了基准测试集中的83个开放问题，并表明CP解决方案与该问题的现有M_（IP）模型具有高度竞争力。

著录项

  • 来源
  • 会议地点 Cork(IE)
  • 作者

    Stefan Kreter; Andreas Schutt; Peter J. Stuckey;

  • 作者单位

    Operations Research Group, Institute of Management and Economics, Clausthal University of Technology, 38678 Clauisthal-Zellerfeld, Germany;

    Optimisation Research Group, National ICT Australia, Melbourne, Australia,Department of Computing and Information Systems, The University of Melbourne, Melbourne, VIC 3010, Australia;

    Optimisation Research Group, National ICT Australia, Melbourne, Australia,Department of Computing and Information Systems, The University of Melbourne, Melbourne, VIC 3010, Australia;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号