Computing redundant resources for the resource constrained project scheduling problem

DOI10.1016/j.ejor.2005.09.034zbMath1104.90018OpenAlexW2049403394MaRDI QIDQ853022

Emmanuel Néron, Jacques Carlier

Publication date: 15 November 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.034

zbMATH Keywords

lower boundsresource-constrained project scheduling problemredundant function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem ⋮ A survey of dual-feasible and superadditive functions ⋮ Redundant cumulative constraints to compute preemptive bounds ⋮ Conservative scales in packing problems ⋮ On the extremality of maximal dual feasible functions ⋮ Theoretical investigations on maximal dual feasible functions ⋮ New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds and reduction procedures for the bin packing problem
• Lower bounds for resource-constrained project scheduling problems.
• On linear lower bounds for the resource constrained project scheduling problem.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• A new LP-based lower bound for the cumulative scheduling problem
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Tight LP bounds for resource constrained project scheduling
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
• Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem
• Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem