首页> 外文会议>Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems; Lecture Notes in Computer Science; 4510 >A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production
【24h】

A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production

机译:具有正负资源消耗-生产的连续多资源累积约束

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

摘要

This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tasks with variable duration and heights. The resource function is no more constant but is a positive or negative piecewise linear function of time. Finally, a task is no more pre-assigned to one resource, but to a task corresponds a set of possible resource assignments. In this context, this article provides an O(p · (log p + q)) for computing all the cumulated resource profiles where q is the number of resources and p is the total number of trapezoid sub-tasks of all the tasks.
机译:本文首先介绍了经典累积约束的扩展:每个任务不再是矩形,而是一系列持续时间和高度可变的连续梯形子任务。资源函数不再是常数,而是时间的正或负分段线性函数。最后,不再将任务预先分配给一个资源,而是将一个任务对应于一组可能的资源分配。在这种情况下,本文提供了一个O(p·(log p + q)),用于计算所有累积的资源配置文件,其中q是资源数量,p是所有任务的梯形子任务总数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号