• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference Automation >A Hybrid CLP/MP Approach to Modeling and Solving Resource-Constrained Scheduling Problems with Logic Constraints
【24h】

A Hybrid CLP/MP Approach to Modeling and Solving Resource-Constrained Scheduling Problems with Logic Constraints

机译：一种混合CLP / MP与逻辑约束建模和解决资源约束调度问题的方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Constrained scheduling problems are common in everyday life and especially in: distribution, manufacturing, project management, logistics, supply chain management, software engineering, computer networks etc. A large number of integer and binary decision variables representing the allocation of different constrained resources to activities/jobs and constraints on these decision variables are typical elements of the resource-constrained scheduling problems (RCSPs) modeling. Therefore, the models of RCSPs are more demanding, particularly when methods of operations research (OR) are used. By contrast, most resource-constrained scheduling problems can be easily modeled as instances of the constraint satisfaction problems (CSPs) and solved using constraint logic programming (CLP) or others methods. Moreover, CLP-based environments enable easy modeling of various types of constraints including logic constraints. In the CLP-based environment the problem definition is separated from the algorithms and methods used to solve the problem. Therefore, a hybrid approach to resource-constrained scheduling problems that combines an OR-based approach for problem solving and a CLP-based approach for problem modeling is proposed. To evaluate the efficiency and flexibility of this approach, illustrative examples of resource-constrained scheduling problems with logic constraints are implemented using hybrid CLP/MP approach.
机译：约束调度问题是在日常生活中，特别是在共同的：分销，制造，项目管理，物流，供应链管理，软件工程，计算机网络等一大批代表着不同的约束资源的活动分配整数和二进制决策变量/作业和约束这些决策变量是资源受限的调度问题（RCSPs）建模的典型元素。因此，RCSPs的模型更苛刻的，尤其是当采用运筹学（OR）的方法。与此相反，大多数资源受限调度问题可以很容易地建模为约束满足问题（CSP的）实例和使用约束逻辑规划（CLP）或其他方法来解决。此外，基于CLP-环境使各种类型的约束，包括逻辑约束容易建模。在基于CLP-环境问题定义从用于解决问题的算法和方法分离。因此，混合方法，以资源受限调度问题，结合对解决问题和问题的建模基于CLP-方法的类或方法建议。为了评价这种方法的效率和灵活性，与逻辑约束资源受限调度问题说明性实施例使用混合CLP / MP方法实现。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号