Computing redundant resources for the resource constrained project scheduling problem

DOI10.1016/J.EJOR.2005.09.034zbMATH Open1104.90018OpenAlexW2049403394MaRDI QIDQ853022FDOQ853022

E. 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

Recommendations

• On linear lower bounds for the resource constrained project scheduling problem.
• Lower bounds for resource-constrained project scheduling problems.
• Tight LP bounds for resource constrained project scheduling
• scientific article
• Redundant cumulative constraints to compute preemptive bounds

zbMATH Keywords

lower boundsresource-constrained project scheduling problemredundant function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Title not available (Why is that?)
• Lower bounds for resource-constrained project scheduling problems.
• Title not available (Why is that?)
• Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
• Constraint-propagation-based cutting planes: an application to the resource-constrained project scheduling problem
• New Benchmark Results for the Resource-Constrained Project Scheduling Problem
• On linear lower bounds for the resource constrained project scheduling problem.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lower bounds and reduction procedures for the bin packing problem
• A new LP-based lower bound for the cumulative scheduling problem
• Title not available (Why is that?)
• Tight LP bounds for resource constrained project scheduling
• Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
• Title not available (Why is that?)

Cited In (9)

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

This page was built for publication: Computing redundant resources for the resource constrained project scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853022)