Edge Finding for Cumulative Scheduling

DOI10.1287/ijoc.1070.0226zbMath1243.90068OpenAlexW2122960360MaRDI QIDQ2901000

Pascal Van Hentenryck, Luc Mercier

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/82934f41b5b881ba72fdb5e5b228ebc8b73e7381

zbMATH Keywords

constraint based schedulingcumulative resourcesedge finding

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (12)

A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) ⋮ A MinCumulative resource constraint ⋮ Redundant cumulative constraints to compute preemptive bounds ⋮ Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited ⋮ Constraint propagation on GPU: a case study for the cumulative constraint ⋮ Strong polynomiality of resource constraint propagation ⋮ Explaining the \texttt{cumulative} propagator ⋮ New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles ⋮ New filtering for the cumulative constraint in the context of non-overlapping rectangles ⋮ Global propagation of side constraints for solving over-constrained problems ⋮ Consecutive ones matrices for multi-dimensional orthogonal packing problems ⋮ A quadratic edge-finding filtering algorithm for cumulative resource constraints

This page was built for publication: Edge Finding for Cumulative Scheduling