Computing redundant resources for the resource constrained project scheduling problem
From MaRDI portal
(Redirected from Publication:853022)
Recommendations
- On linear lower bounds for the resource constrained project scheduling problem.
- Lower bounds for resource-constrained project scheduling problems.
- Tight LP bounds for resource constrained project scheduling
- scientific article; zbMATH DE number 5132358
- Redundant cumulative constraints to compute preemptive bounds
Cites work
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- scientific article; zbMATH DE number 1187157 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 1488068 (Why is no real title available?)
- scientific article; zbMATH DE number 1405789 (Why is no real title available?)
- scientific article; zbMATH DE number 279273 (Why is no real title available?)
- 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
- Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
- Lower bounds and reduction procedures for the bin packing problem
- Lower bounds for resource-constrained project scheduling problems.
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- On linear lower bounds for the resource constrained project scheduling problem.
- Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- Tight LP bounds for resource constrained project scheduling
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(9)- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- A survey of dual-feasible and superadditive functions
- On the extremality of maximal dual feasible functions
- Redundant cumulative constraints to compute preemptive bounds
- Conservative scales in packing problems
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- Theoretical investigations on maximal dual feasible functions
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
This page was built for publication: Computing redundant resources 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 Q853022)
