A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
From MaRDI portal
(Redirected from Publication:709101)
Recommendations
- A preemptive bound for the resource constrained project scheduling problem
- On linear lower bounds for the resource constrained project scheduling problem.
- scientific article; zbMATH DE number 5132358
- A linear programming and constraint propagation-based lower bound for the RCPSP
- A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
Cites work
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Project scheduling with time windows. From theory to applications.
- Project scheduling. A research handbook.
- Scheduling subject to resource constraints: Classification and complexity
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
Cited in
(17)- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
- 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?)
- Lower bounds for a multi-skill project scheduling problem
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- A preemptive bound for the resource constrained project scheduling problem
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- Project scheduling with generalized precedence relations: a new method to analyze criticalities and flexibilities
- Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- Simplifying activity networks under generalized precedence relations to extended CPM networks
- A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
This page was built for publication: A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709101)
