An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
From MaRDI portal
(Redirected from Publication:439614)
Recommendations
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
- An exact algorithm for minimizing resource availability costs in project scheduling
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- scientific article; zbMATH DE number 2086192
- An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan 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
- 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 preemptive bound for the resource constrained project scheduling problem
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
Cites work
- scientific article; zbMATH DE number 4135692 (Why is no real title available?)
- scientific article; zbMATH DE number 2013754 (Why is no real title available?)
- scientific article; zbMATH DE number 1405789 (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
- A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Project scheduling with time windows. From theory to applications.
- Project scheduling. A research handbook.
- Solving project scheduling problems by minimum cut computations
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(15)- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
- A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply
- On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
- An effective approach for scheduling coupled activities in development projects
- A min-flow algorithm for minimal critical set detection in resource constrained project scheduling
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- A branch-and-bound algorithm for the unit-capacity resource constrained project scheduling problem with transfer times
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
- PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem
- Resource leveling in projects with flexible structures
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
This page was built for publication: An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439614)
