Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
From MaRDI portal
Publication:1806914
DOI10.1016/S0377-2217(97)00442-6zbMath0938.90030MaRDI QIDQ1806914
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations, The sample analysis machine scheduling problem: definition and comparison of exact solving approaches, Computing redundant resources for the resource constrained project scheduling problem, Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation, 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, Going to the core of hard resource-constrained project scheduling instances, A preemptive bound for the resource constrained project scheduling problem, The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics, A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem, 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., A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints, Continuous-time formulations for multi-mode project scheduling, A Boolean satisfiability approach to 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, Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption., The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds, Solving the resource-constrained project scheduling problem by a variable neighbourhood search., Using dual presolving reductions to reformulate cumulative constraints, A constraint programming approach for the resource-constrained project scheduling problem, Scheduling and constraint propagation, A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations, Resource-constrained project scheduling: Notation, classification, models, and methods, \texttt{Absalom}: balancing assembly lines with assignment restrictions, Bidirectional planning: Improving priority rule-based heuristics for scheduling resource-constrained projects, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, A linear programming and constraint propagation-based lower bound for the RCPSP, An enumerative heuristic and reduction methods for the assembly line balancing problem, A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
Uses Software
Cites Work
- Some efficient multi-heuristic procedures for resource-constrained project scheduling
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- On the use of the complexity index as a measure of complexity in activity networks
- A branch and bound algorithm for the resource-constrained project scheduling problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- Une méthode arborescente pour résoudre les problèmes cumulatifs
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- An investigation into the relationship of heuristic performance with network-resource characteristics
- New Benchmark Results for the Resource-Constrained Project Scheduling Problem
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
