Abstract.
The best lower bound for the Resource Constrained Project Scheduling Problem is currently based on the resolution of several large Linear Programs (Brucker & Knust, EJOR, 107: 272-288, 1998). In this paper, we show that (1) intensive constraint propagation can be used to tighten the initial formulation of the linear programs and (2) we introduce several sets of valid cutting planes. These improvements allow us to “close” 16 new instances of the PSPLIB with 60 activities and to improve the best known lower bounds of 64 instances.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Correspondence to:Philippe Baptiste
The authors would like to thank Peter Brucker and Sigrid Knust for providing their source code as well as Christian Artigues, Jacques Carlier and Philippe Michelon for enlightening discussions on project scheduling.
Rights and permissions
About this article
Cite this article
Baptiste, P., Demassey, S. Tight LP bounds for resource constrained project scheduling. OR Spectrum 26, 251–262 (2004). https://doi.org/10.1007/s00291-003-0155-1
Issue Date:
DOI: https://doi.org/10.1007/s00291-003-0155-1