Cited in
(40)- Allocation and scheduling of conditional task graphs
- Online control of enumeration strategies via bat algorithm and black hole optimization
- Global constraint catalogue: past, present and future
- Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
- How efficient is a global constraint in practice? A fair experimental framework
- Explaining the \texttt{cumulative} propagator
- Event-based MILP models for resource-constrained project scheduling problems
- Tight LP bounds for resource constrained project scheduling
- On not-first/not-last conditions in disjunctive scheduling
- A cumulative not-first/not-last filtering algorithm in \(O(n^2 \log(n))\)
- Models for global constraint applications
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Principles and Practice of Constraint Programming – CP 2004
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- PSPLIB
- LSSPER
- CLAIRE
- CHIP
- JOBSHOP
- CPGraph
- MPSPLib
- RanGen
- ILOG SCHEDULE
- ToOLS
- Oz Explorer
- HIBISCUS
- MiniCP
- A quadratic edge-finding filtering algorithm for cumulative resource constraints
- Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem
- A unified framework for partial and hybrid search methods in constraint programming
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
- Using dual presolving reductions to reformulate cumulative constraints
- On linear lower bounds for the resource constrained project scheduling problem.
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
- A constraint programming approach for the resource-constrained project scheduling problem
- A new LP-based lower bound for the cumulative scheduling problem
- CUD@SAT
- Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
This page was built for software: BL data set
