A preemptive bound for the resource constrained project scheduling problem
From MaRDI portal
(Redirected from Publication:398922)
Recommendations
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- A linear programming and constraint propagation-based lower bound for the RCPSP
- Lower bounds for resource-constrained project scheduling problems.
- On some implementations of solving the resource constrained project scheduling problems
- Tight LP bounds for resource constrained project scheduling
Cites work
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
- A fast algorithm for the maximum clique problem
- A linear programming and constraint propagation-based lower bound for the RCPSP
- A new LP-based lower bound for the cumulative scheduling problem
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- Event-based MILP models for resource-constrained project scheduling problems
- Explaining the \texttt{cumulative} propagator
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- On linear lower bounds for the resource constrained project scheduling problem.
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- PSPLIB -- a project scheduling problem library
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Project scheduling. A research handbook.
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Solving project scheduling problems by minimum cut computations
- The project scheduling polyhedron: Dimension, facets and lifting theorems
- Tight LP bounds for resource constrained project scheduling
- Timetable edge finding filtering algorithm for discrete cumulative resources
- Une méthode arborescente pour résoudre les problèmes cumulatifs
Cited in
(12)- Approximability results for the resource-constrained project scheduling problem with a single type of resources
- scientific article; zbMATH DE number 5132358 (Why is no real title available?)
- Two deadline reduction algorithms for scheduling dependent tasks on parallel processors
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Measuring the slack between lower bounds for scheduling on parallel machines
- Tight LP bounds for resource constrained project scheduling
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- A polyhedral study of event-based models 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
- Pre-emption in resource-constrained project scheduling
This page was built for publication: A preemptive bound for the resource constrained project scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398922)
