Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
From MaRDI portal
Publication:766253
Recommendations
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- scientific article; zbMATH DE number 5132358
- Lower bounds for resource-constrained project scheduling problems.
- On linear lower bounds for the resource constrained project scheduling problem.
Cites work
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- A new formulation of the resource-unconstrained project scheduling problem with generalized precedence relations to minimize the completion time
- Project scheduling with time windows. From theory to applications.
- Project scheduling. A research handbook.
- RCPS with variable intensity activities and feeding precedence constraints
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- The Traveling-Salesman Problem and Minimum Spanning Trees
Cited in
(11)- Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm
- Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
- A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan
- RCPS with variable intensity activities and feeding precedence constraints
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem
- Benders decomposition for a period-aggregated resource leveling problem with variable job duration
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
This page was built for publication: Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766253)
