Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources

DOI10.1007/978-3-642-21311-3_22zbMath1302.90090OpenAlexW1572114607MaRDI QIDQ3003292

Petr Vilím

Publication date: 26 May 2011

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_22

zbMATH Keywords

schedulingpropagationConstraint programmingdiscrete cumulative resource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG ⋮ Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) ⋮ A MinCumulative resource constraint ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ 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 ⋮ Using constraint programming for solving RCPSP/MAX-cal ⋮ Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions ⋮ A quadratic edge-finding filtering algorithm for cumulative resource constraints ⋮ Synchronized sweep algorithms for scalable scheduling constraints

This page was built for publication: Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources