摘要翻译：
本技术报告提出了一种具有广义优先级的资源受限项目调度问题（RCPSP/MAX）的最小化项目工期的通用精确求解方法。该方法采用有限域和布尔可满足性求解相结合的惰性子句生成方法，将nogood学习和冲突驱动搜索应用于解的生成。我们的实验证明了惰性子句生成在寻找最优解和证明其最优性方面的优势，并与其他先进的精确和非精确方法进行了比较。该方法具有很强的鲁棒性：根据PSPLIB上目前可用的数据，它匹配或改善了我们检查的所有2340个实例中的最佳已知结果，除了3个。在这个集合中的631个打开的实例中，它关闭了573个，并改进了其余58个实例中51个的边界。
---
英文标题：
《Solving the Resource Constrained Project Scheduling Problem with
  Generalized Precedences by Lazy Clause Generation》
---
作者：
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark G. Wallace
---
最新提交年份：
2010
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  The technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized precedences (Rcpsp/max). The approach uses lazy clause generation, i.e., a hybrid of finite domain and Boolean satisfiability solving, in order to apply nogood learning and conflict-driven search on the solution generation. Our experiments show the benefit of lazy clause generation for finding an optimal solutions and proving its optimality in comparison to other state-of-the-art exact and non-exact methods. The method is highly robust: it matched or bettered the best known results on all of the 2340 instances we examined except 3, according to the currently available data on the PSPLib. Of the 631 open instances in this set it closed 573 and improved the bounds of 51 of the remaining 58 instances.
---
PDF链接：
https://arxiv.org/pdf/1009.0347