Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

DOI10.1016/j.cor.2011.05.022zbMath1251.90152MaRDI QIDQ1762094

Mohamed Haouari, Anis Kooli, Emmanuel Néron

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.05.022

zbMATH Keywords

lower bounds; dual feasible functions; energetic reasoning; resource constrained project scheduling problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

A preemptive bound for the resource constrained project scheduling problem

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• Energetic reasoning revisited: Application to parallel machine scheduling
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
• Scheduling subject to resource constraints: Classification and complexity
• PSPLIB -- a project scheduling problem library
• Adjustment of heads and tails for the job-shop problem
• Project scheduling. A research handbook.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
• Satisfiability tests and time-bound adjustments for cumulative scheduling problems
• Fast lifting procedures for the bin packing problem
• IP-Based Energetic Reasoning for the Resource Constrained Project Scheduling Problem
• Une méthode arborescente pour résoudre les problèmes cumulatifs
• Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs