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

Authors:
Nicolas Beldiceanu;Emmanuel Poder
Affiliations:
École des Mines de Nantes, LINA FRE CNRS 2729, 4 rue Alfred Kastler, La Chantrerie, BP 20722, 44307 Nantes Cedex 3, France;École des Mines de Nantes, LINA FRE CNRS 2729, 4 rue Alfred Kastler, La Chantrerie, BP 20722, 44307 Nantes Cedex 3, France
Venue:
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2007

Citing 4
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
Algorithms for propagating resource constraints in AI planning and scheduling: existing approaches and new results

Artificial Intelligence
Computing the Envelope for Stepwise-Constant Resource Allocations

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A New Multi-resource cumulatives Constraint with Negative Heights

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming

Constraint based scheduling to deal with uncertain durations and self-timed execution

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A resource cost aware cumulative

CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article first introduces an extension of the classical cumulativeconstraint: 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·(logp+ q)) for computing all the cumulated resource profiles where qis the number of resources and pis the total number of trapezoid sub-tasks of all the tasks.