Emmanuel Poder, Nicolas Beldiceanu
Within the framework of continuous and multi-resources cumulative constraints, a task T expresses a piecewise linear resource function and is represented by a sequence of p contiguous trapezoid sub-tasks with variable durations and heights. In this context, this paper provides an algorithm in O(p) for filtering the resource assignment and the temporal attributes of such a task, according to a trapezoid of a minimum cumulated resource profile, in order to avoid an overflow of the resource capacity.
Subjects: 1.12 Scheduling; 3.2 Geometric Or Spatial Reasoning
Submitted: Jun 26, 2008