Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
From MaRDI portal
Recommendations
Cites work
- A branch and bound algorithm for the resource-constrained project scheduling problem
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
- An investigation into the relationship of heuristic performance with network-resource characteristics
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- On the use of the complexity index as a measure of complexity in activity networks
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Une méthode arborescente pour résoudre les problèmes cumulatifs
Cited in
(40)- \texttt{Absalom}: balancing assembly lines with assignment restrictions
- Insertion techniques for static and dynamic resource-constrained project scheduling.
- Resource-constrained project scheduling: A critical activity reordering heuristic
- Lower bounds for resource-constrained project scheduling problems.
- On linear lower bounds for the resource constrained project scheduling problem.
- Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- A linear programming and constraint propagation-based lower bound for the RCPSP
- A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects
- An enumerative heuristic and reduction methods for the assembly line balancing problem
- Tight LP bounds for resource constrained project scheduling
- The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
- A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
- The sample analysis machine scheduling problem: definition and comparison of exact solving approaches
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds
- A Boolean satisfiability approach to the resource-constrained project scheduling problem
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Going to the core of hard resource-constrained project scheduling instances
- A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
- Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation
- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
- A preemptive bound for the resource constrained project scheduling problem
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Project scheduling with flexible resources: formulation and inequalities
- Using dual presolving reductions to reformulate cumulative constraints
- A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem
- Continuous-time formulations for multi-mode project scheduling
- A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty
- Reducing the feasible solution space of resource-constrained project instances
- Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
- Fifty years of research on resource-constrained project scheduling explored from different perspectives
- Scheduling and constraint propagation
- A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
- Stability factor for robust balancing of transfer lines under task processing time uncertainty
- Computing redundant resources for the resource constrained project scheduling problem
- A constraint programming approach for the resource-constrained project scheduling problem
This page was built for publication: Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806914)
