IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem

DOI10.1016/J.ENDM.2010.05.046zbMath1237.90092OpenAlexW2062572375MaRDI QIDQ2883582

Mohamed Haouari, Anis Kooli, Lotfi Hidri, Emmanuel Néron

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.046

zbMATH Keywords

lower boundenergetic reasoningresource constrained project scheduling problem\texttt{PSPLIB}

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (2)

Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem ⋮ A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Energetic reasoning revisited: Application to parallel machine scheduling
• Scheduling subject to resource constraints: Classification and complexity
• PSPLIB -- a project scheduling problem library
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Tight LP bounds for resource constrained project scheduling
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• Une méthode arborescente pour résoudre les problèmes cumulatifs

This page was built for publication: IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem