Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
From MaRDI portal
Publication:4922915
DOI10.1007/978-3-642-38171-3_16zbMath1382.68232arXiv1208.3015OpenAlexW1884966213MaRDI QIDQ4922915
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey
Publication date: 4 June 2013
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://arxiv.org/abs/1208.3015
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ A MinCumulative resource constraint ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ A project scheduling problem with periodically aggregated resource-constraints ⋮ Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited ⋮ Using constraint programming for solving RCPSP/MAX-cal ⋮ Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems ⋮ Sharpening constraint programming approaches for bit-vector theory ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
Uses Software
This page was built for publication: Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
