Tight LP bounds for resource constrained project scheduling

DOI10.1007/s00291-003-0155-1zbMath1072.90012OpenAlexW2090923074MaRDI QIDQ1880319

Sophie Demassey, Philippe Baptiste

Publication date: 22 September 2004

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-003-0155-1

zbMATH Keywords

linear programminglower boundsconstraint propagationresource-constrained project scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (21)

IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem ⋮ Energetic reasoning revisited: Application to parallel machine scheduling ⋮ Computing redundant resources for the resource constrained project scheduling problem ⋮ Branch-and-Cut-and-Price algorithms for the preemptive RCPSP ⋮ Global constraint catalogue: past, present and future ⋮ A project scheduling problem with periodically aggregated resource-constraints ⋮ Linear programming based algorithms for preemptive and non-preemptive RCPSP ⋮ A preemptive bound for the resource constrained project scheduling problem ⋮ Redundant cumulative constraints to compute preemptive bounds ⋮ A Boolean satisfiability approach to the resource-constrained project scheduling problem ⋮ Project scheduling with flexible resources: formulation and inequalities ⋮ An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem ⋮ A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags ⋮ A constraint programming approach for the resource-constrained project scheduling problem ⋮ Towards merging binary integer programming techniques with genetic algorithms ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Earliness-tardiness scheduling with setup considerations ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints ⋮ On some implementations of solving the resource constrained project scheduling problems ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes

Uses Software

• PSPLIB
• BL data set

This page was built for publication: Tight LP bounds for resource constrained project scheduling