Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems

Related Items (18)

Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last ⋮ An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration ⋮ A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\) ⋮ Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search ⋮ Global constraint catalogue: past, present and future ⋮ Insertion techniques for static and dynamic resource-constrained project scheduling. ⋮ On linear lower bounds for the resource constrained project scheduling problem. ⋮ How efficient is a global constraint in practice? A fair experimental framework ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ Explaining the \texttt{cumulative} propagator ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ A constraint programming approach for the resource-constrained project scheduling problem ⋮ Allocation and scheduling of conditional task graphs ⋮ A unified framework for partial and hybrid search methods in constraint programming ⋮ Event-based MILP models for resource-constrained project scheduling problems ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints ⋮ Online control of enumeration strategies via bat algorithm and black hole optimization ⋮ A quadratic edge-finding filtering algorithm for cumulative resource constraints

Uses Software

This page was built for publication: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems